Sciweavers

5699 search results - page 43 / 1140
» Alternating model trees
Sort
View
CONCUR
1998
Springer
15 years 3 months ago
Alternating Refinement Relations
Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system compo...
Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, ...
ICIP
2001
IEEE
16 years 17 days ago
Coding theoretic approach to image segmentation
This paper introduces multi-scale tree-based approaches to image segmentation, using Rissanen's coding theoretic minimum description length (MDL) principle to penalize overly...
Mário A. T. Figueiredo, Robert D. Nowak, Un...
EMNLP
2004
15 years 11 days ago
Induction of Greedy Controllers for Deterministic Treebank Parsers
Most statistical parsers have used the grammar induction approach, in which a stochastic grammar is induced from a treebank. An alternative approach is to induce a controller for ...
Tom Kalt
BIRTHDAY
2003
Springer
15 years 4 months ago
Using Alternating Words to Describe Symbolic Pictures
In this paper we present the concepts of drawn symbolic picture and symbolic picture. Such notions have been conceived as an extension of the concept of drawn pictures which was i...
Gennaro Costagliola, Vincenzo Deufemia, Filomena F...
IANDC
2006
83views more  IANDC 2006»
14 years 11 months ago
Implicit complexity over an arbitrary structure: Quantifier alternations
We provide machine-independent characterizations of some complexity classes, over an arbitrary structure, in the model of computation proposed by L. Blum, M. Shub and S. Smale. We...
Olivier Bournez, Felipe Cucker, Paulin Jacob&eacut...