911 search results - page 86 / 183 » On the Distance of Databases |
SIGMOD
2008
ACM
14 years 7 months ago
2008
ACM
A method for approximate subsequence matching is introduced, that significantly improves the efficiency of subsequence matching in large time series data sets under the dynamic ti...
ICDE
2010
IEEE
14 years 7 months ago
2010
IEEE
Abstract-- We consider the Top-k Approximate Subtree Matching (TASM) problem: finding the k best matches of a small query tree, e.g., a DBLP article with 15 nodes, in a large docum...
SMI
2008
IEEE
14 years 2 months ago
2008
IEEE
In this paper we propose a novel algorithm for 3D shape searching based on the visual similarity by cutting the object into sections. This method rectifies some of the shortcomin...
CCECE
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper, the authors present an evaluation of a new biometric based on electrocardiogram (ECG) waveforms. ECG data were collected from 50 subjects during 3 data recordings s...
ICIAR
2005
Springer
14 years 1 months ago
2005
Springer
In this study, we propose two algorithms for measuring the distance between shape boundaries. In the algorithms, shape boundary is represented by the Beam Angle Statistics (BAS), w...