2489 search results - page 137 / 498 » On the Subgroup Distance Problem |
186
Voted
CGIM
2003
15 years 5 months ago
2003
We propose a novel method for the problem of 3D surface mesh segmentation. This mesh segmentation method is based on differential geometry and geodesic distance information. In ou...
262
click to vote
ICDE
2005
IEEE
16 years 5 months ago
2005
IEEE
Efficiently and accurately searching for similarities among time series and discovering interesting patterns is an important and non-trivial problem. In this paper, we introduce a...
142
click to vote
KDD
2005
ACM
16 years 4 months ago
2005
ACM
One fundamental task in near-neighbor search as well as other similarity matching efforts is to find a distance function that can efficiently quantify the similarity between two o...
149
click to vote
KDD
2003
ACM
16 years 4 months ago
2003
ACM
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...
231
click to vote
SIGMOD
2005
ACM
16 years 4 months ago
2005
ACM
A common problem in many types of databases is retrieving the most similar matches to a query object. Finding those matches in a large database can be too slow to be practical, es...