118 search results - page 13 / 24 » Approximation Schemes for Euclidean k-Medians and Related Pr... |
NETWORKING
2007
13 years 9 months ago
2007
Abstract. In this paper, we study the localization problem in large-scale underwater sensor networks. The adverse aqueous environments, the node mobility, and the large network sca...
APPROX
2008
Springer
13 years 9 months ago
2008
Springer
Abstract. We are interested in efficient algorithms for generating random samples from geometric objects such as Riemannian manifolds. As a step in this direction, we consider the ...
COMPGEOM
2009
ACM
14 years 2 months ago
2009
ACM
Integration over a domain, such as a Euclidean space or a Riemannian manifold, is a fundamental problem across scientific fields. Many times, the underlying domain is only acces...
INFOCOM
2006
IEEE
14 years 1 months ago
2006
IEEE
Abstract— Sensors typically use wireless transmitters to communicate with each other. However, sensors may be located in a way that they cannot even form a connected network (e.g...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...