Sciweavers

5785 search results - page 261 / 1157
» Approximability of Probability Distributions
Sort
View
IPSN
2007
Springer
15 years 10 months ago
Approximate isocontours and spatial summaries for sensor networks
We consider the problem of approximating a family of isocontours in a sensor field with a topologically-equivalent family of simple polygons. Our algorithm is simple and distribu...
Sorabh Gandhi, John Hershberger, Subhash Suri
SC
2003
ACM
15 years 9 months ago
Parallel Multilevel Sparse Approximate Inverse Preconditioners in Large Sparse Matrix Computations
We investigate the use of the multistep successive preconditioning strategies (MSP) to construct a class of parallel multilevel sparse approximate inverse (SAI) preconditioners. W...
Kai Wang, Jun Zhang, Chi Shen
NETWORKS
2006
15 years 4 months ago
Approximation algorithms for channel allocation problems in broadcast networks
We study two packing problems that arise in the area of dissemination-based information systems; a second theme is the study of distributed approximation algorithms. The problems c...
Rajiv Gandhi, Samir Khuller, Aravind Srinivasan, N...
ALGORITHMICA
2005
110views more  ALGORITHMICA 2005»
15 years 4 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...
INFOCOM
2010
IEEE
15 years 2 months ago
Maintaining Approximate Minimum Steiner Tree and k-center for Mobile Agents in a Sensor Network
Abstract--We study the problem of maintaining group communication between m mobile agents, tracked and helped by n static networked sensors. We develop algorithms to maintain a O(l...
Dengpan Zhou, Jie Gao