Sciweavers

441 search results - page 85 / 89
» Query expansion using random walk models
Sort
View
FQAS
2009
Springer
129views Database» more  FQAS 2009»
14 years 4 months ago
Representing Context Information for Document Retrieval
The bag of words representation (BoW), which is widely used in information retrieval (IR), represents documents and queries as word lists that do not express anything about context...
Maya Carrillo, Esaú Villatoro-Tello, Aureli...
ICALP
2004
Springer
14 years 3 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
STOC
2005
ACM
150views Algorithms» more  STOC 2005»
14 years 10 months ago
Correcting errors without leaking partial information
This paper explores what kinds of information two parties must communicate in order to correct errors which occur in a shared secret string W. Any bits they communicate must leak ...
Yevgeniy Dodis, Adam Smith
ICDE
2007
IEEE
111views Database» more  ICDE 2007»
14 years 11 months ago
Proof Sketches: Verifiable In-Network Aggregation
Recent work on distributed, in-network aggregation assumes a benign population of participants. Unfortunately, modern distributed systems are plagued by malicious participants. In...
Minos N. Garofalakis, Joseph M. Hellerstein, Petro...
GIS
2008
ACM
14 years 11 months ago
Mapping geographic coverage of the web
In this paper, we describe a methodology to estimate the geographic coverage of the web without the need for secondary knowledge or complex geo-tagging. This is achieved by random...
Robert Pasley, Paul Clough, Ross S. Purves, Floria...