250 search results - page 16 / 50 » A metric cache for similarity search |
205
click to vote
ICDE
2000
IEEE
16 years 1 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...
107
click to vote
SISAP
2009
IEEE
15 years 6 months ago
2009
IEEE
—In the demonstration we will show a system for searching by similarity and automatically classifying images in a very large dataset. The demonstrated techniques are based on the...
141
click to vote
VLDB
1999
ACM
15 years 4 months ago
1999
ACM
The nearest- or near-neighbor query problems arise in a large variety of database applications, usually in the context of similarity searching. Of late, there has been increasing ...
UAI
2000
15 years 1 months ago
2000
This paper is about the use of metric data structures in high-dimensionalor non-Euclidean space to permit cached sufficientstatisticsaccelerationsof learning algorithms. It has re...
107
click to vote
ICS
2007
Tsinghua U.
15 years 6 months ago
2007
Tsinghua U.
This paper presents Cooperative Cache Partitioning (CCP) to allocate cache resources among threads concurrently running on CMPs. Unlike cache partitioning schemes that use a singl...