824 search results - page 48 / 165 » Efficient Distance Computation Between Non-Convex Objects |
ICDE
2002
IEEE
14 years 9 months ago
2002
IEEE
We investigate techniques for analysis and retrieval of object trajectories in a two or three dimensional space. Such kind of data usually contain a great amount of noise, that ma...
SEBD
1997
13 years 9 months ago
1997
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, ...
KDD
2000
ACM
13 years 11 months ago
2000
ACM
Many important problems involve clustering large datasets. Although naive implementations of clustering are computationally expensive, there are established efficient techniques f...
ICCV
1995
IEEE
13 years 11 months ago
1995
IEEE
A novel scheme for the detection of object boundaries is presented. The technique is based on active contours evolving in time according to intrinsic geometric measures of the imag...
NIPS
2004
13 years 9 months ago
2004
Various problems in machine learning, databases, and statistics involve pairwise distances among a set of objects. It is often desirable for these distances to satisfy the propert...