461 search results - page 77 / 93 » Letters |
CPC
2004
14 years 9 months ago
2004
Let C be a code of length n over an alphabet of q letters. A codeword y is called a descendant of a set of t codewords {x1 , . . . , xt } if yi {x1 i , . . . , xt i} for all i = ...
JIIS
2000
14 years 9 months ago
2000
Abstract. A paper document processing system is an information system component which transforms information on printed or handwritten documents into a computer-revisable form. In ...
JUCS
2002
14 years 9 months ago
2002
: The problem about the synchronization of a finite deterministic automaton is not yet properly understood. The present paper investigates this and related problems within the gene...
ML
1998
ACM
14 years 9 months ago
1998
ACM
We introduce, analyze and demonstrate a recursive hierarchical generalization of the widely used hidden Markov models, which we name Hierarchical Hidden Markov Models (HHMM). Our m...
NETWORKS
2002
14 years 9 months ago
2002
The de Bruijn digraph B(d, D) has degree d, diameter D, dD vertices and dD+1 arcs. It is usually defined by words of size D on an alphabet of cardinality d, through a cyclic left ...