36 search results - page 3 / 8 » The Query Complexity of Finding Local Minima in the Lattice |
ALGORITHMICA
2010
13 years 7 months ago
2010
In this paper, we give a lower bound of (n(d-1)/2 ) on the quantum query complexity for finding a fixed point of a discrete Brouwer function over grid [1 : n]d . Our bound is near...
AAAI
2004
13 years 8 months ago
2004
Algorithms based on following local gradient information are surprisingly effective for certain classes of constraint satisfaction problems. Unfortunately, previous local search a...
SERVICES
2008
13 years 8 months ago
2008
Distributed stream query services must simultaneously process a large number of complex, continuous queries with stringent performance requirements while utilizing distributed pro...
JUCS
2010
13 years 1 months ago
2010
: We address the question of how to communicate among distributed processes values such as real numbers, continuous functions and geometrical solids with arbitrary precision, yet e...
INFOCOM
2009
IEEE
14 years 1 months ago
2009
IEEE
Abstract—We are interested in topological analysis and processing of the large-scale distributed data generated by sensor networks. Naturally a large-scale sensor network is depl...