Sciweavers

2498 search results - page 260 / 500
» Algorithms for the Topological Watershed
Sort
View
CACM
2006
90views more  CACM 2006»
15 years 6 months ago
Creating an adaptive network of hubs using Schelling's model
Thomas Schelling's model suggests an explanation for the existence of segregated neighborhoods in America. This paper presents a study on utilizing Schelling's model to c...
Atul Singh, Mads Haahr
CORR
2006
Springer
101views Education» more  CORR 2006»
15 years 6 months ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....
CORR
2007
Springer
86views Education» more  CORR 2007»
15 years 6 months ago
On the Discovery of Random Trees
Abstract. We consider in this paper the problem of discovering, via a traceroute algorithm, the topology of a network, whose graph is spanned by an infinite branching process. A s...
Fabrice Guillemin, Philippe Robert
JPDC
2008
103views more  JPDC 2008»
15 years 6 months ago
On termination detection in crash-prone distributed systems with failure detectors
We investigate the problem of detecting termination of a distributed computation in systems where processes can fail by crashing. Specifically, when the communication topology is ...
Neeraj Mittal, Felix C. Freiling, Subbarayan Venka...
NECO
1998
119views more  NECO 1998»
15 years 5 months ago
Density Estimation by Mixture Models with Smoothing Priors
In the statistical approach for self-organizing maps (SOMs), learning is regarded as an estimation algorithm for a Gaussian mixture model with a Gaussian smoothing prior on the ce...
Akio Utsugi