Sciweavers

2145 search results - page 200 / 429
» Pattern-Based Query Answering
Sort
View
SWAT
2000
Springer
90views Algorithms» more  SWAT 2000»
15 years 6 months ago
Efficient Expected-Case Algorithms for Planar Point Location
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
Sunil Arya, Siu-Wing Cheng, David M. Mount, Ramesh...
CCS
2008
ACM
15 years 5 months ago
Authenticated hash tables
Hash tables are fundamental data structures that optimally answer membership queries. Suppose a client stores n elements in a hash table that is outsourced at a remote server so t...
Charalampos Papamanthou, Roberto Tamassia, Nikos T...
TREC
2003
15 years 4 months ago
Overview of the TREC 2003 Web Track
The TREC 2003 web track consisted of both a non-interactive stream and an interactive stream. Both streams worked with the .GOV test collection. The non-interactive stream continu...
Nick Craswell, David Hawking, Ross Wilkinson, Ming...
ALGORITHMICA
2004
132views more  ALGORITHMICA 2004»
15 years 2 months ago
A General Model for Authenticated Data Structures
Query answers from on-line databases can easily be corrupted by hackers or malicious database publishers. Thus it is important to provide mechanisms which allow clients to trust th...
Charles U. Martel, Glen Nuckolls, Premkumar T. Dev...
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 6 months ago
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of t...
Andrei E. Romashchenko