661 search results - page 18 / 133 » On Distributed Computation in Noisy Random Planar Networks |
DMSN
2004
ACM
14 years 25 days ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
KIVS
2005
Springer
14 years 27 days ago
2005
Springer
: We develop a model for the distribution of nodes in ring-based DHTs like Chord that position nodes randomly or based on hash-functions. As benefit of our model we get the distri...
COMPGEOM
2006
ACM
14 years 1 months ago
2006
ACM
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
SPAA
2009
ACM
14 years 4 months ago
2009
ACM
A K-smoothing network is a distributed, low-contention data structure where tokens arrive arbitrarily on w input wires and reach w output wires via their completely asynchronous p...
PERCOM
2003
ACM
14 years 7 months ago
2003
ACM
We present a WLAN location determination technique, the Joint Clustering technique, that uses (1) signal strength probability distributions to address the noisy wireless channel, ...