116 search results - page 11 / 24 » Near optimal online algorithms and fast approximation algori... |
INFOCOM
2003
IEEE
14 years 23 days ago
2003
IEEE
—Wireless communications using ad hoc networks are receiving an increasing interest. The most attractive feature of ad hoc networks is the flexibility. The network is set up by ...
SIGMOD
2003
ACM
14 years 7 months ago
2003
ACM
We consider the problem of approximating sliding window joins over data streams in a data stream processing system with limited resources. In our model, we deal with resource cons...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
In this paper I investigate several offline and online data transfer scheduling problems and propose efficient algorithms and techniques for addressing them. In the offline case, ...
CDC
2009
IEEE
14 years 6 days ago
2009
IEEE
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
STOC
2001
ACM
14 years 7 months ago
2001
ACM
Histograms are typically used to approximate data distributions. Histograms and related synopsis structures have been successful in a wide variety of popular database applications...