24 search results - page 5 / 5 » Probabilistic Optimization of Top N Queries |
STOC
2006
ACM
14 years 5 months ago
2006
ACM
The PCP theorem [3, 2] says that every language in NP has a witness format that can be checked probabilistically by reading only a constant number of bits from the proof. The cele...
VLDB
2004
ACM
14 years 5 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
14 years 5 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 ...
SIGIR
2009
ACM
13 years 11 months ago
2009
ACM
Pseudo relevance feedback (PRF), which has been widely applied in IR, aims to derive a distribution from the top n pseudo relevant documents D. However, these documents are often ...