441 search results - page 11 / 89 » Query expansion using random walk models |
ICCV
2007
IEEE
14 years 4 months ago
2007
IEEE
Given a query image of an object, our objective is to retrieve all instances of that object in a large (1M+) image database. We adopt the bag-of-visual-words architecture which ha...
SIGIR
2006
ACM
14 years 3 months ago
2006
ACM
We present a novel framework for answering complex questions that relies on question decomposition. Complex questions are decomposed by a procedure that operates on a Markov chain...
RSA
2006
13 years 9 months ago
2006
We present a (non-standard) probabilistic analysis of dynamic data structures whose sizes are considered as dynamic random walks. The basic operations (insertion, deletion, positi...
CIKM
2007
Springer
14 years 4 months ago
2007
Springer
As one of the most effective query expansion approaches, local feedback is able to automatically discover new query terms and improve retrieval accuracy for different retrieval ...
SIGIR
2008
ACM
13 years 9 months ago
2008
ACM
Pseudo-feedback-based automatic query expansion yields effective retrieval performance on average, but results in performance inferior to that of using the original query for many...