Sciweavers

2089 search results - page 21 / 418
» A New Problem in String Searching
Sort
View
FCT
2005
Springer
15 years 3 months ago
A New Linearizing Restriction in the Pattern Matching Problem
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of...
Yo-Sub Han, Derick Wood

Publication
285views
15 years 1 months ago
Center of mass encoding: a self-adaptive representation with adjustable redundancy for real-valued parameters
In this paper we describe a new class of representations for realvalued parameters called Center of Mass Encoding (CoME). CoME is based on variable length strings, it is self-adap...
Claudio Mattiussi, Peter Dürr, Dario Floreano
ICML
2002
IEEE
15 years 10 months ago
Syllables and other String Kernel Extensions
During the last years, the use of string kernels that compare documents has been shown to achieve good results on text classification problems. In this paper we introduce the appl...
Craig Saunders, Hauke Tschach, John Shawe-Taylor
IWOCA
2009
Springer
117views Algorithms» more  IWOCA 2009»
15 years 2 months ago
On the Maximal Number of Cubic Subwords in a String
We investigate the problem of the maximum number of cubic subwords (of the form www) in a given word. We also consider square subwords (of the form ww). The problem of the maximum ...
Marcin Kubica, Jakub Radoszewski, Wojciech Rytter,...
DEXA
2007
Springer
150views Database» more  DEXA 2007»
15 years 3 months ago
Sequence Alignment as a Database Technology Challenge
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
Hans Philippi