Sciweavers

39 search results - page 7 / 8
» Average Bit-Complexity of Euclidean Algorithms
Sort
View
ICDCS
2006
IEEE
14 years 1 months ago
GMP: Distributed Geographic Multicast Routing in Wireless Sensor Networks
In this paper, we propose a novel Geographic Multicast routing Protocol (GMP) for wireless sensor networks1 . The proposed protocol is fully distributed and stateless. Given a set...
Shibo Wu, K. Selçuk Candan
CDC
2009
IEEE
152views Control Systems» more  CDC 2009»
14 years 5 days ago
Distributed image-based 3-D localization of camera sensor networks
— We consider the problem of distributed estimation of the poses of N cameras in a camera sensor network using image measurements only. The relative rotation and translation (up ...
Roberto Tron, René Vidal
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
13 years 7 months ago
Geographic Quorum System Approximations
Quorum systems are a mechanism for obtaining fault-tolerance and efficient distributed systems. We consider geographic quorum systems; a geographic quorum system is a partition of...
Paz Carmi, Shlomi Dolev, Sariel Har-Peled, Matthew...
AUSAI
2010
Springer
13 years 4 months ago
A Heuristic on Effective and Efficient Clustering on Uncertain Objects
We study the problem of clustering uncertain objects whose locations are uncertain and described by probability density functions. We analyze existing pruning algorithms and experi...
Edward Hung, Lei Xu, Chi-Cheong Szeto
ICCV
2011
IEEE
12 years 7 months ago
Means in spaces of tree-like shapes
The mean is often the most important statistic of a dataset as it provides a single point that summarizes the entire set. While the mean is readily defined and computed in Euclid...
Aasa Feragen, Søren Hauberg, Mads Nielsen, Franç...