Sciweavers

1541 search results - page 171 / 309
» Analysis of Random Noise and Random Walk Algorithms
Sort
View
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 8 months ago
Networks become navigable as nodes move and forget
Abstract. We propose a dynamic process for network evolution, aiming at explaining the emergence of the small world phenomenon, i.e., the statistical observation that any pair of i...
Augustin Chaintreau, Pierre Fraigniaud, Emmanuelle...
DIALM
2008
ACM
168views Algorithms» more  DIALM 2008»
13 years 10 months ago
Local broadcasting in the physical interference model
In this work we analyze the complexity of local broadcasting in the physical interference model. We present two distributed randomized algorithms: one that assumes that each node ...
Olga Goussevskaia, Thomas Moscibroda, Roger Watten...

Presentation
1518views
15 years 9 months ago
Stochastic Segmentation of Blood Vessels From Time-of-Flight
In this paper, we present an automatic statistical approach for extracting 3D blood vessels from time-of-flight (TOF) magnetic resonance angiography (MRA) data. The voxels of the d...
M. Sabry Hassouna
SIAMAM
2011
13 years 3 months ago
Imaging Schemes for Perfectly Conducting Cracks
We consider the problem of locating perfectly conducting cracks and estimating their geometric features from multi-static response matrix measurements at a single or multiple frequ...
Habib Ammari, Josselin Garnier, Hyeonbae Kang, Won...
COMGEO
2004
ACM
13 years 8 months ago
Speeding up the incremental construction of the union of geometric objects in practice
We present a new incremental algorithm for constructing the union of n triangles in the plane. In our experiments, the new algorithm, which we call the Disjoint-Cover (DC) algorit...
Eti Ezra, Dan Halperin, Micha Sharir