248 search results - page 3 / 50 » Geometrical Probability Covering Algorithm |
DCOSS
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. Achieving optimal battery usage and prolonged network lifetime are two of the most fundamental issues in wireless sensor networks. By exploiting node and data redundancy ...
ICASSP
2009
IEEE
14 years 7 days ago
2009
IEEE
The paper first recalls the Blahut Arimoto algorithm for computing the capacity of arbitrary discrete memoryless channels, as an example of an iterative algorithm working with pro...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
We give a general framework for the problem of finding all minimal hitting sets of a family of objects in Rd by another. We apply this framework to the following problems: (i) hit...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
ESA
2009
Springer
14 years 2 months ago
2009
Springer
We consider problems on data sets where each data point has uncertainty described by an individual probability distribution. We develop several frameworks and algorithms for calcul...