Sciweavers

995 search results - page 24 / 199
» String Pattern Discovery
Sort
View
PR
2006
152views more  PR 2006»
13 years 7 months ago
Edit distance-based kernel functions for structural pattern classification
A common approach in structural pattern classification is to define a dissimilarity measure on patterns and apply a distance-based nearest-neighbor classifier. In this paper, we i...
Michel Neuhaus, Horst Bunke
ALT
2003
Springer
14 years 4 months ago
On the Learnability of Erasing Pattern Languages in the Query Model
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
Steffen Lange, Sandra Zilles
CPM
1999
Springer
107views Combinatorics» more  CPM 1999»
13 years 12 months ago
A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text
We address the problem of string matching on Ziv-Lempel compressed text. The goal is to search a pattern in a text without uncompressing it. This is a highly relevant issue to keep...
Gonzalo Navarro, Mathieu Raffinot
ISCAS
2008
IEEE
120views Hardware» more  ISCAS 2008»
14 years 1 months ago
A baseball exploration system using spatial pattern recognition
— Despite a lot of research efforts in baseball video processing, little work has been done in analyzing the detailed process and ball movement of the batting content. This paper...
Hua-Tsiing Chen, Ming-Ho Hsiao, Hsuan-Sheng Chen, ...
CORR
2010
Springer
200views Education» more  CORR 2010»
13 years 7 months ago
Unified Compression-Based Acceleration of Edit-Distance Computation
The edit distance problem is a classical fundamental problem in computer science in general, and in combinatorial pattern matching in particular. The standard dynamic programming s...
Danny Hermelin, Gad M. Landau, Shir Landau, Oren W...