3652 search results - page 405 / 731 » A study of query length |
129
click to vote
CHI
2008
ACM
16 years 4 months ago
2008
ACM
Sometimes people cannot remember the names or locations of things on their computer, but they can remember what other things are associated with them. We created Feldspar, the fir...
138
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
A common thread in all the recent results concerning the testing of dense graphs is the use of Szemer?edi's regularity lemma. In this paper we show that in some sense this is...
138
click to vote
SOSP
2001
ACM
16 years 1 months ago
2001
ACM
In most distributed systems, naming of nodes for low-level communication leveragestopologicallocation(such as node addresses) and is independentof any application. In this paper, ...
134
click to vote
WSDM
2009
ACM
15 years 11 months ago
2009
ACM
We study the problem of answering ambiguous web queries in a setting where there exists a taxonomy of information, and that both queries and documents may belong to more than one ...
190
click to vote
P2P
2009
IEEE
15 years 11 months ago
2009
IEEE
Distributed systems such as Peer-to-Peer overlays have been shown to efficiently support the processing of range queries over large numbers of participating hosts. In such system...