Sciweavers

2850 search results - page 342 / 570
» Answering Queries using Humans, Algorithms and Databases
Sort
View
157
Voted
PODS
2005
ACM
164views Database» more  PODS 2005»
16 years 3 months ago
Lower bounds for sorting with few random accesses to external memory
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...
Martin Grohe, Nicole Schweikardt
139
Voted
CIKM
2007
Springer
15 years 9 months ago
Predictive user click models based on click-through history
Web search engines consistently collect information about users interaction with the system: they record the query they issued, the URL of presented and selected documents along w...
Benjamin Piwowarski, Hugo Zaragoza
143
Voted
STOC
2007
ACM
98views Algorithms» more  STOC 2007»
16 years 4 months ago
Negative weights make adversaries stronger
The quantum adversary method is one of the most successful techniques for proving lower bounds on quantum query complexity. It gives optimal lower bounds for many problems, has ap...
Peter Høyer, Troy Lee, Robert Spalek
152
Voted
MIR
2006
ACM
162views Multimedia» more  MIR 2006»
15 years 9 months ago
Dynamic similarity search in multi-metric spaces
An important research issue in multimedia databases is the retrieval of similar objects. For most applications in multimedia databases, an exact search is not meaningful. Thus, mu...
Benjamin Bustos, Tomás Skopal
141
Voted
SIGMOD
2005
ACM
166views Database» more  SIGMOD 2005»
16 years 3 months ago
Substructure Similarity Search in Graph Databases
Advanced database systems face a great challenge raised by the emergence of massive, complex structural data in bioinformatics, chem-informatics, and many other applications. The ...
Xifeng Yan, Philip S. Yu, Jiawei Han