Sciweavers

2608 search results - page 381 / 522
» Inferring Answers to Queries
Sort
View
ICALP
2004
Springer
15 years 12 months ago
The Black-Box Complexity of Nearest Neighbor Search
We define a natural notion of efficiency for approximate nearest-neighbor (ANN) search in general n-point metric spaces, namely the existence of a randomized algorithm which answ...
Robert Krauthgamer, James R. Lee
PAM
2004
Springer
15 years 12 months ago
Measurements and Laboratory Simulations of the Upper DNS Hierarchy
Given that the global DNS system, especially at the higher root and top-levels, experiences significant query loads, we seek to answer the following questions: (1) How does the ch...
Duane Wessels, Marina Fomenkov, Nevil Brownlee, Ki...
COMPGEOM
2003
ACM
15 years 11 months ago
Cache-oblivious data structures for orthogonal range searching
We develop cache-oblivious data structures for orthogonal range searching, the problem of finding all T points in a set of N points in Êd lying in a query hyper-rectangle. Cache...
Pankaj K. Agarwal, Lars Arge, Andrew Danner, Bryan...
WWW
2010
ACM
15 years 10 months ago
Towards natural question guided search
Web search is generally motivated by an information need. Since asking well-formulated questions is the fastest and the most natural way to obtain information for human beings, al...
Alexander Kotov, ChengXiang Zhai
CONCUR
2006
Springer
15 years 10 months ago
Sanity Checks in Formal Verification
One of the advantages of temporal-logic model-checking tools is their ability to accompany a negative answer to the correctness query by a counterexample to the satisfaction of the...
Orna Kupferman