36 search results - page 2 / 8 » Pattern Matching by Sequential Subdivision of Transformation... |
SODA
1997
ACM
13 years 6 months ago
1997
ACM
Given two planar polylines T and P with n and m edges, respectively, we present an O m2 n2 time, O mn space algorithm to nd portions of the text" T which are similar in sh...
EMNLP
2007
13 years 6 months ago
2007
In Sequential Viterbi Models, such as HMMs, MEMMs, and Linear Chain CRFs, the type of patterns over output sequences that can be learned by the model depend directly on the modelâ...
CIKM
2004
Springer
13 years 10 months ago
2004
Springer
Biosequences typically have a small alphabet, a long length, and patterns containing gaps (i.e., “don’t care”) of arbitrary size. Mining frequent patterns in such sequences ...
LREC
2008
13 years 6 months ago
2008
Pattern matching, or querying, over annotations is a general purpose paradigm for inspecting, navigating, mining, and transforming annotation repositories--the common representati...
ICCV
2003
IEEE
14 years 7 months ago
2003
IEEE
Evaluating sums of multivariate Gaussians is a common computational task in computer vision and pattern recognition, including in the general and powerful kernel density estimatio...