Sciweavers

2089 search results - page 27 / 418
» A New Problem in String Searching
Sort
View
JDA
2007
73views more  JDA 2007»
14 years 9 months ago
Parameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 ...tn and pattern p = p1p2 ...pm over respective alphabets Σt and Σp, t...
Alberto Apostolico, Péter L. Erdös, Mo...
ECML
2004
Springer
15 years 3 months ago
Using String Kernels to Identify Famous Performers from Their Playing Style
Abstract. In this paper we show a novel application of string kernels: that is to the problem of recognising famous pianists from their style of playing. The characterstics of perf...
Craig Saunders, David R. Hardoon, John Shawe-Taylo...
ECML
2007
Springer
15 years 3 months ago
Learning Balls of Strings with Correction Queries
When facing the question of learning languages in realistic settings, one has to tackle several problems that do not admit simple solutions. On the one hand, languages are usually...
Leonor Becerra-Bonache, Colin de la Higuera, Jean-...
CSCLP
2004
Springer
15 years 3 months ago
Characterization of a New Restart Strategy for Randomized Backtrack Search
We propose an improved restart strategy for randomized backtrack search, and evaluate its performance by comparing to other heuristic and stochastic search techniques for solving r...
Venkata Praveen Guddeti, Berthe Y. Choueiry
MVA
2002
147views Computer Vision» more  MVA 2002»
14 years 9 months ago
Extraction of Character String Areas from Color Scenery Image Using Extended Psychological Potential Field
As digital cameras have been used widely, a technology to extract features of character string areas from scenery (nature) image is required. However, it is very difficult to extr...
Masanori Anegawa, Akira Nakamura