779 search results - page 80 / 156 » Determining Time of Queries for Re-ranking Search Results |
169
click to vote
MICAI
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Kernel based methods (such as k-nearest neighbors classifiers) for AI tasks translate the classification problem into a proximity search problem, in a space that is usu...
136
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we present two contributions to improve accuracy and speed of an image search system based on bag-of-features: a contextual dissimilarity measure (CDM) and an effici...
166
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
Personalization has been deemed one of the major challenges in information retrieval with a significant potential for providing better search experience to individual users. Espec...
143
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
In this paper we investigate how to scale a content based image retrieval approach beyond the RAM limits of a single computer and to make use of its hard drive to store the featur...
168
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
We consider the approximate nearest neighbour search problem on the Hamming cube {0, 1}d. We show that a randomised cell probe algorithm that uses polynomial storage and word size...