1074 search results - page 190 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
181
click to vote
SIGIR
2011
ACM
14 years 14 days ago
2011
ACM
Large search engines process thousands of queries per second over billions of documents, making query processing a major performance bottleneck. An important class of optimization...
WWW
2005
ACM
15 years 10 months ago
2005
ACM
We consider the problem of efficiently sampling Web search engine query results. In turn, using a small random sample instead of the full set of results leads to efficient approxi...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
174
Voted
VLDB
2004
ACM
15 years 10 months ago
2004
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In i...
SIGMOD
2003
ACM
15 years 9 months ago
2003
ACM
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. In ...