Sciweavers

524 search results - page 27 / 105
» Context Trees
Sort
View
IPL
2002
117views more  IPL 2002»
13 years 7 months ago
Complexity of weak acceptance conditions in tree automata
Weak acceptance conditions for automata on infinite words or trees are defined in terms of the set of states that appear in the run. This is in contrast with, more usual, strong c...
Jakub Neumann, Andrzej Szepietowski, Igor Walukiew...
PAMI
2011
13 years 2 months ago
Bilayer Segmentation of Webcam Videos Using Tree-Based Classifiers
—This paper presents an automatic segmentation algorithm for video frames captured by a (monocular) webcam that closely approximates depth segmentation from a stereo camera. The ...
Pei Yin, Antonio Criminisi, John M. Winn, Irfan A....
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 7 months ago
Self-stabilization with Byzantine tolerance for global tasks
Self-stabilization is a versatile approach to fault-tolerance since it permits a distributed system to recover from any transient fault that arbitrarily corrupts the contents of a...
Swan Dubois, Toshimitsu Masuzawa, Sébastien...
SGAI
2010
Springer
13 years 5 months ago
Induction of Modular Classification Rules: Using Jmax-pruning
The Prism family of algorithms induces modular classification rules which, in contrast to decision tree induction algorithms, do not necessarily fit together into a decision tree s...
Frederic T. Stahl, Max Bramer
ACL
2007
13 years 8 months ago
A Symbolic Approach to Near-Deterministic Surface Realisation using Tree Adjoining Grammar
Surface realisers divide into those used in generation (NLG geared realisers) and those mirroring the parsing process (Reversible realisers). While the first rely on grammars not...
Claire Gardent, Eric Kow