32 search results - page 4 / 7 » Reference-based indexing for metric spaces with costly dista... |
104
click to vote
JWSR
2007
15 years 1 months ago
2007
: Business processes continue to play an important role in today’s service-oriented enterprise computing systems. Mining, discovering, and integrating process-oriented services h...
144
click to vote
SIGMOD
2005
ACM
15 years 6 months ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
ADC
1999
Springer
15 years 5 months ago
1999
Springer
We introduce a cost model for the M-tree access method [Ciaccia et al., 1997] which provides estimates of CPU (distance computations) and I/O costs for the execution of similarity ...
108
click to vote
STOC
2007
ACM
16 years 1 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
131
click to vote
ALENEX
2001
15 years 2 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...