562 search results - page 56 / 113 » Approximation algorithms and hardness of the k-route cut pro... |
IPSN
2009
Springer
14 years 2 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
CALC
2001
Springer
14 years 18 days ago
2001
Springer
We show that recent results of Coppersmith, Boneh, Durfee and Howgrave-Graham actually apply in the more general setting of (partially) approximate common divisors. This leads us t...
SIGMOD
2008
ACM
13 years 8 months ago
2008
ACM
We consider the problem of evaluating multiple overlapping queries defined on data streams, where each query is a conjunction of multiple filters and each filter may be shared acr...
CORR
2006
Springer
13 years 8 months ago
2006
Springer
While in general trading off exploration and exploitation in reinforcement learning is hard, under some formulations relatively simple solutions exist. Optimal decision thresholds ...
STOC
2010
ACM
14 years 6 days ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...