Sciweavers

3818 search results - page 174 / 764
» Word Problems on Compressed Words
Sort
View
LICS
2006
IEEE
16 years 4 days ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
DNA
2004
Springer
157views Bioinformatics» more  DNA 2004»
15 years 11 months ago
Bond-Free Languages: Formalizations, Maximality and Construction Methods
The problem of negative design of DNA languages is addressed, that is, properties and construction methods of large sets of words that prevent undesired bonds when used in DNA com...
Lila Kari, Stavros Konstantinidis, Petr Sosí...
TAL
2004
Springer
15 years 11 months ago
Ontology-Based Feature Transformations: A Data-Driven Approach
Abstract. We present a novel approach to incorporating semantic information to the problems of natural language processing, in particular to the document classification task. The ...
Filip Ginter, Sampo Pyysalo, Jorma Boberg, Jouni J...
CSR
2010
Springer
15 years 11 months ago
Validating the Knuth-Morris-Pratt Failure Function, Fast and Online
Let πw denote the failure function of the Knuth-Morris-Pratt algorithm for a word w. In this paper we study the following problem: given an integer array A [1 . . n], is there a w...
Pawel Gawrychowski, Artur Jez, Lukasz Jez
156
Voted
CAIP
2001
Springer
126views Image Analysis» more  CAIP 2001»
15 years 10 months ago
A Technique for Segmentation of Gurmukhi Text
This paper describes a technique for text segmentation of machine printed Gurmukhi script documents. Research in the field of segmentation of Gurmukhi script faces major problems m...
G. S. Lehal, Chandan Singh