614 search results - page 1 / 123 » Local Computation: Lower and Upper Bounds |
CORR
2010
Springer
13 years 1 months ago
2010
Springer
STOC
2006
ACM
14 years 5 months ago
2006
ACM
Local Search problem, which finds a local minimum of a black-box function on a given graph, is of both practical and theoretical importance to combinatorial optimization, complexi...
COLT
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
WIOPT
2011
IEEE
12 years 8 months ago
2011
IEEE
—This paper studies the performance of ad hoc networks with local FDMA scheduling using stochastic point processes. In such networks, the Poisson assumption is not justified due...
STACS
2005
Springer
13 years 10 months ago
2005
Springer