608 search results - page 67 / 122 » On Dependent Randomized Rounding Algorithms |
ESA
2007
Springer
14 years 3 months ago
2007
Springer
We present an algorithm for finding frequent elements in a stream where the arrivals are not bursty. Depending on the amount of burstiness in the stream our algorithm detects elem...
COMPGEOM
2004
ACM
14 years 2 months ago
2004
ACM
We consider the problem of approximate range counting over streams of d-dimensional points. In the data stream model, the algorithm makes a single scan of the data, which is prese...
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...
WWW
2004
ACM
14 years 9 months ago
2004
ACM
The overwhelming success of the Web as a mechanism for facilitating information retrieval and for conducting business transactions has led to an increase in the deployment of comp...
IAT
2009
IEEE
14 years 3 months ago
2009
IEEE
In building practical sensor networks, it is often beneficial to use only a subset of sensors to take measurements because of computational, communication, and power limitations....