Sciweavers

3368 search results - page 25 / 674
» The Complexity of Query Reliability
Sort
View
FOCS
2006
IEEE
14 years 1 months ago
On the Quantum Query Complexity of Local Search in Two and Three Dimensions
The quantum query complexity of searching for local optima has been a subject of much interest in the recent literature. For the d-dimensional grid graphs, the complexity has been...
Xiaoming Sun, Andrew Chi-Chih Yao
SIGIR
2010
ACM
13 years 7 months ago
Learning to rank query reformulations
Query reformulation techniques based on query logs have recently proven to be effective for web queries. However, when initial queries have reasonably good quality, these techniqu...
Van Dang, Michael Bendersky, W. Bruce Croft
DBISP2P
2004
Springer
111views Database» more  DBISP2P 2004»
14 years 28 days ago
Processing and Optimization of Complex Queries in Schema-Based P2P-Networks
Peer-to-Peer infrastructures are emerging as one of the important data management infrastructures in the World Wide Web. So far, however, most work has focused on simple P2P networ...
Hadhami Dhraief, Alfons Kemper, Wolfgang Nejdl, Ch...
ALT
1998
Springer
13 years 11 months ago
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries
Exact learning of half-spaces over finite subsets of IRn from membership queries is considered. We describe the minimum set of labelled examples separating the target concept from ...
Valery N. Shevchenko, Nikolai Yu. Zolotykh
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
14 years 7 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy