نتایج جستجو برای: mean weighted diameter

تعداد نتایج: 768343  

2007
Annika Kangas Lauri Mehtätalo Matti Maltamo

In percentile method, percentiles of the diameter distribution are predicted with a system of models. The continuous empirical diameter distribution function is then obtained by interpolating between the predicted values of percentiles. In Finland, the distribution is typically modelled as a basal-area weighted distribution, which is transformed to a traditional density function for application...

2009
H. M. Fonteijn M. G. Hall D. C. Alexander

Introduction In this abstract we show that the diffusion-weighted (DW) signal from the extracellular space can be used to estimate white matter microstructure parameters, such as axon diameter distribution and volume fraction. A key challenge in Diffusion-Weighted Imaging (DWI) is to estimate more specific features of tissue microstructure than existing methods such as Diffusion Tensor Imaging ...

Journal: :JSME international journal. Ser. 2, Fluids engineering, heat transfer, power, combustion, thermophysical properties 1991

Journal: :TRANSACTIONS OF THE JAPAN SOCIETY OF MECHANICAL ENGINEERS Series B 1999

2012
Charles A. Sennoga James S.M. Yeh Julia Alter Eleanor Stride Petros Nihoyannopoulos John M. Seddon Dorian O. Haskard Joseph V. Hajnal Meng-Xing Tang Robert J. Eckersley

A precise, accurate and well documented method for the sizing and counting of microbubbles is essential for all aspects of quantitative microbubble-enhanced ultrasound imaging. The efficacy of (a) electro-impedance volumetric zone sensing (ES) also called a Coulter counter/multisizer; (b) optical microscopy (OM); and (c) laser diffraction (LD), for the sizing and counting of microbubbles was as...

2012
Pierluigi Crescenzi Roberto Grossi Leonardo Lanzi Andrea Marino

In this paper we propose a new algorithm for computing the diameter of directed unweighted graphs. Even though, in the worst case, this algorithm has complexity O(nm), where n is the number of nodes and m is the number of edges of the graph, we experimentally show that in practice our method works in O(m) time. Moreover, we show how to extend our algorithm to the case of directed weighted graph...

Journal: :CoRR 2010
Raphael Yuster

We present a new randomized algorithm for computing the diameter of a weighted directed graph. The algorithm runs in Õ(Mn 2+3)/(ω+1)) time, where ω < 2.376 is the exponent of fast matrix multiplication, n is the number of vertices of the graph, and the edge weights are integers in {−M, . . . , 0, . . . ,M}. For bounded integer weights the running time is O(n) and if ω = 2+ o(1) it is Õ(n). This...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید