3818 search results - page 12 / 764 » Word Problems on Compressed Words |
CORR
2006
Springer
14 years 9 months ago
2006
Springer
We survey the emerging area of compression-based, parameter-free, similarity distance measures useful in data-mining, pattern recognition, learning and automatic semantics extracti...
109
click to vote
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The complexity of the isomorphism problem for regular trees, regular linear orders, and regular words is analyzed. A tree is regular if it is isomorphic to the prefix order on a r...
LATA
2009
Springer
15 years 4 months ago
2009
Springer
In this paper we investigate the computational complexity of knot theoretic problems and show upper and lower bounds for planarity problem of signed and unsigned knot diagrams repr...
ATVA
2010
Springer
14 years 6 months ago
2010
Springer
The problem of synthesising a reactive system is discussed. The most standard instance of this problem ask to construct a finite input-output automaton satisfying a given regular s...
ISCI
2006
14 years 9 months ago
2006
The use of the computing with words paradigm for the automatic text documents categorization problem is discussed. This specific problem of information retrieval (IR) becomes more...