Sciweavers

250 search results - page 20 / 50
» A metric cache for similarity search
Sort
View
ADC
2003
Springer
127views Database» more  ADC 2003»
15 years 5 months ago
M+-tree : A New Dynamical Multidimensional Index for Metric Spaces
In this paper, we propose a new metric index, called M+ -tree, which is a tree dynamically organized for large datasets in metric spaces. The proposed M+ -tree takes full advantag...
Xiangmin Zhou, Guoren Wang, Jeffrey Xu Yu, Ge Yu
SEBD
1997
158views Database» more  SEBD 1997»
15 years 1 months ago
Indexing Metric Spaces with M-Tree
M-tree is a dynamic access method suitable to index generic “metric spaces”, where the function used to compute the distance between any two objects satisfies the positivity, ...
Paolo Ciaccia, Marco Patella, Fausto Rabitti, Pave...
AIPS
2006
15 years 1 months ago
Resource Contention Metrics for Oversubscribed Scheduling Problems
We investigate a task insertion heuristic for oversubscribed scheduling problems, max-availability, that uses a simple estimate of resource contention to assign tasks to intervals...
Laurence A. Kramer, Stephen F. Smith
PAMI
2012
13 years 2 months ago
IntentSearch: Capturing User Intention for One-Click Internet Image Search
—Web-scale image search engines (e.g. Google Image Search, Bing Image Search) mostly rely on surrounding text features. It is difficult for them to interpret users’ search int...
Xiaoou Tang, Ke Liu, Jingyu Cui, Fang Wen, Xiaogan...
ICPADS
2006
IEEE
15 years 5 months ago
Oriented Overlays For Clustering Client Requests To Data-Centric Network Services
Many of the data-centric network services deployed today hold massive volumes of data at their origin websites, and access the data to dynamically generate responses to user reque...
Congchun He, Vijay Karamcheti