467 search results - page 18 / 94 » Processing top k queries from samples |
ALDT
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. An optimal probabilistic-planning algorithm solves a problem, usually modeled by a Markov decision process, by finding its optimal policy. In this paper, we study the k ...
DASFAA
2003
IEEE
14 years 2 months ago
2003
IEEE
Modern database applications including computeraided design (CAD), medical imaging, or molecular biology impose new requirements on spatial query processing. Particular problems a...
SIGMOD
2002
ACM
14 years 9 months ago
2002
ACM
Applications like multimedia retrieval require efficient support for similarity search on large data collections. Yet, nearest neighbor search is a difficult problem in high dimen...
ECIR
2009
Springer
14 years 6 months ago
2009
Springer
It is well known that the use of a good Machine Transliteration system improves the retrieval performance of Cross-Language Information Retrieval (CLIR) systems when the query and ...
NAACL
1994
13 years 10 months ago
1994
The normal practice of selecting relevant documents for training routing queries is to either use all relevants or the 'best n' of them after a (retrieval) ranking opera...