254 search results - page 24 / 51 » Multiple Approximate String Matching |
AVSS
2005
IEEE
14 years 1 months ago
2005
IEEE
A novel region-based multiple object tracking framework based on Kalman filtering and elastic matching is proposed. The proposed Kalman filtering-elastic matching model is gener...
DEBU
2000
13 years 7 months ago
2000
Detecting database records that are approximate duplicates, but not exact duplicates, is an important task. Databases may contain duplicate records concerning the same real-world ...
IAAI
2003
13 years 9 months ago
2003
Pattern matching for intelligence organizations is a challenging problem. The data sets are large and noisy, and there is a flexible and constantly changing notion of what consti...
SODA
2010
ACM
13 years 6 months ago
2010
ACM
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
JMLR
2010
13 years 2 months ago
2010
To save memory and improve speed, vectorial data such as images and signals are often represented as strings of discrete symbols (i.e., sketches). Chariker (2002) proposed a fast ...