3341 search results - page 204 / 669 » On Bounded Queries and Approximation |
149
click to vote
ICALP
2003
Springer
15 years 11 months ago
2003
Springer
Suppose we have n algorithms, quantum or classical, each computing some bit-value with bounded error probability. We describe a quantum algorithm that uses O( √ n) repetitions of...
116
click to vote
SODA
2001
ACM
15 years 7 months ago
2001
ACM
Most information-retrieval systems preprocess the data to produce an auxiliary index structure. Empirically, it has been observed that there is a tradeoff between query response t...
159
click to vote
EJC
2008
15 years 5 months ago
2008
Abstract. Classes of graphs with bounded expansion are a generalization of both proper minor closed classes and degree bounded classes. Such classes are based on a new invariant, t...
153
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
Abstract. The declustering problem is to allocate given data on parallel working storage devices in such a manner that typical requests find their data evenly distributed among the...
139
click to vote
NIPS
2007
15 years 7 months ago
2007
In many structured prediction problems, the highest-scoring labeling is hard to compute exactly, leading to the use of approximate inference methods. However, when inference is us...