3223 search results - page 182 / 645 » The Scaling of Search Cost |
221
click to vote
EVOW
2012
Springer
14 years 2 months ago
2012
Springer
Abstract. We consider the two-echelon location-routing problem (2ELRP), a well-known problem in freight distribution arising when establishing a two-level transport system with lim...
192
click to vote
ALENEX
2001
15 years 8 months ago
2001
Range searches in metric spaces can be very di cult if the space is \high dimensional", i.e. when the histogram of distances has a large mean and a small variance. The so-cal...
412
click to vote
ICDE
2000
IEEE
16 years 7 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
188
click to vote
KDD
2002
ACM
16 years 7 months 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...
157
click to vote
CVPR
2010
IEEE
16 years 2 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 ...