Sciweavers

421 search results - page 10 / 85
» String Distances and Uniformities
Sort
View
AMDO
2006
Springer
13 years 11 months ago
Action Recognition Using Motion Primitives and Probabilistic Edit Distance
In this paper we describe a recognition approach based on the notion of primitives. As opposed to recognizing actions based on temporal trajectories or temporal volumes, primitive-...
Preben Fihl, Michael B. Holte, Thomas B. Moeslund,...
KDD
2003
ACM
214views Data Mining» more  KDD 2003»
14 years 7 months ago
Adaptive duplicate detection using learnable string similarity measures
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...
Mikhail Bilenko, Raymond J. Mooney
ADMA
2005
Springer
134views Data Mining» more  ADMA 2005»
13 years 9 months ago
An LZ78 Based String Kernel
We develop the notion of normalized information distance (NID) [7] into a kernel distance suitable for use with a Support Vector Machine classifier, and demonstrate its use for an...
Ming Li, Ronan Sleep
BMCBI
2010
86views more  BMCBI 2010»
13 years 7 months ago
Fast motif recognition via application of statistical thresholds
Background: Improving the accuracy and efficiency of motif recognition is an important computational challenge that has application to detecting transcription factor binding sites...
Christina Boucher, James King
STOC
2003
ACM
98views Algorithms» more  STOC 2003»
14 years 7 months ago
A sublinear algorithm for weakly approximating edit distance
We show how to determine whether the edit distance between two given strings is small in sublinear time. Specifically, we present a test which, given two n-character strings A and...
Tugkan Batu, Funda Ergün, Joe Kilian, Avner M...