2638 search results - page 148 / 528 » Extracting Approximate Patterns |
115
click to vote
JNS
2010
15 years 3 months ago
2010
This paper introduces a new method to show the validity of a continuum description for the deterministic dynamics of many interacting particles. Here the many particle evolution is...
129
click to vote
ALT
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
170
click to vote
CPM
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Approximate string matching is a fundamental and challenging problem in computer science, for which a fast algorithm is highly demanded in many applications including tex...
143
click to vote
GBRPR
2005
Springer
15 years 10 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...
139
click to vote
PAMI
2011
14 years 11 months ago
2011
—Subspaces offer convenient means of representing information in many pattern recognition, machine vision, and statistical learning applications. Contrary to the growing populari...