Sciweavers

118 search results - page 13 / 24
» Approximation Schemes for Euclidean k-Medians and Related Pr...
Sort
View
NETWORKING
2007
15 years 1 months ago
Localization for Large-Scale Underwater Sensor Networks
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...
Zhong Zhou, Jun-Hong Cui, Shengli Zhou
APPROX
2008
Springer
83views Algorithms» more  APPROX 2008»
15 years 1 months ago
Sampling Hypersurfaces through Diffusion
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 ...
Hariharan Narayanan, Partha Niyogi
COMPGEOM
2009
ACM
15 years 6 months ago
Integral estimation from point cloud in d-dimensional space: a geometric view
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...
Chuanjiang Luo, Jian Sun, Yusu Wang
INFOCOM
2006
IEEE
15 years 5 months ago
Relay Placement for Higher Order Connectivity in Wireless Sensor Networks
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...
Abhishek Kashyap, Samir Khuller, Mark A. Shayman
CORR
2008
Springer
88views Education» more  CORR 2008»
14 years 11 months ago
Lower bounds for distributed markov chain problems
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...
Rahul Sami, Andy Twigg