1461 search results - page 72 / 293 » The Cost of Cache-Oblivious Searching |
105
click to vote
KDD
2002
ACM
16 years 9 days ago
2002
ACM
This paper presents an approach to automatically optimizing the retrieval quality of search engines using clickthrough data. Intuitively, a good information retrieval system shoul...
CVPR
2010
IEEE
15 years 7 months ago
2010
IEEE
We present an efficient pixel-sampling technique for histogram-based search. Given a template image as a query, a typical histogram-based algorithm aims to find the location of ...
107
click to vote
ICCS
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. The Evolutionary Geometric Near-neighbor Access Tree (EGNAT) is a recently proposed data structure that is suitable for indexing large collections of complex objects. It ...
IPPS
2006
IEEE
15 years 6 months ago
2006
IEEE
In this work we present a system for implementing the placement and routing stages in the FPGA cycle of design, into the physical design stage. We start with the ISCAS benchmarks,...
SIGIR
2004
ACM
15 years 5 months ago
2004
ACM
: We consider the problem of collaborative Web search and query routing strategies in a peer-to-peer (P2P) environment. In our architecture every peer has a full-fledged search en...