944 search results - page 105 / 189 » Heuristic Search for Large Problems With Real Costs |
ISMIR
2005
Springer
15 years 3 months ago
2005
Springer
We describe a recursive algorithm to quickly compute the N nearest neighbors according to a similarity measure in a metric space. The algorithm exploits an intrinsic property of a...
CIKM
2008
Springer
15 years 1 hour ago
2008
Springer
In contextual advertising, estimating the number of impressions of an ad is critical in planning and budgeting advertising campaigns. However, producing this forecast, even within...
116
click to vote
ALENEX
2001
14 years 11 months ago
2001
In nearest neighbor searching we are given a set of n data points in real d-dimensional space, d , and the problem is to preprocess these points into a data structure, so that give...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Sub-image search with high accuracy in natural images still remains a challenging problem. This paper proposes a new feature vector called profile for a keypoint in a bag of visual...
DEXA
2010
Springer
14 years 11 months ago
2010
Springer
The class of k Nearest Neighbor (kNN) queries in spatial networks has been widely studied in the literature. All existing approaches for kNN search in spatial networks assume that ...