Sciweavers

104 search results - page 8 / 21
» Tree Automata with Global Constraints
Sort
View
AUSAI
2003
Springer
14 years 24 days ago
Reduction of Non Deterministic Automata for Hidden Markov Model Based Pattern Recognition Applications
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...
Frédéric Maire, Frank Wathne, Alain ...
GCB
1997
Springer
74views Biometrics» more  GCB 1997»
13 years 11 months ago
Using constraint programming for lattice protein folding
We present a global search technique for nding the global minimal conformation of a sequence in Dill's HP-lattice model5;6 . The HP-lattice model is a simpli ed model of prot...
Rolf Backofen
BMCBI
2006
112views more  BMCBI 2006»
13 years 7 months ago
Phylophenetic properties of metabolic pathway topologies as revealed by global analysis
Background: As phenotypic features derived from heritable characters, the topologies of metabolic pathways contain both phylogenetic and phenetic components. In the post-genomic e...
Yong Zhang, Shaojuan Li, Geir Skogerbø, Zhi...
LICS
2008
IEEE
14 years 1 months ago
Winning Regions of Higher-Order Pushdown Games
In this paper we consider parity games defined by higher-order pushdown automata. These automata generalise pushdown automata by the use of higher-order stacks, which are nested ...
Arnaud Carayol, Matthew Hague, Antoine Meyer, C.-H...
POPL
2002
ACM
14 years 7 months ago
The first-order theory of subtyping constraints
We investigate the first-order theory of subtyping constraints. We show that the first-order theory of nonstructural subtyping is undecidable, and we show that in the case where a...
Zhendong Su, Alexander Aiken, Joachim Niehren, Tim...