Sciweavers

105 search results - page 3 / 21
» On the formal points of the formal topology of the binary tr...
Sort
View
IANDC
2010
128views more  IANDC 2010»
13 years 4 months ago
A coinductive calculus of binary trees
We study the set TA of infinite binary trees with nodes labelled in a semiring A from a coalgebraic perspective. We present coinductive definition and proof principles based on ...
Alexandra Silva, Jan J. M. M. Rutten
IGARSS
2010
13 years 3 months ago
New hyperspectral data representation using binary partition tree
The optimal exploitation of the information provided by hyperspectral images requires the development of advanced image processing tools. This paper introduces a new hierarchical ...
Silvia Valero, Philippe Salembier, Jocelyn Chanuss...
CORR
2007
Springer
141views Education» more  CORR 2007»
13 years 6 months ago
Acyclicity of Preferences, Nash Equilibria, and Subgame Perfect Equilibria: a Formal and Constructive Equivalence
Abstract. Sequential game and Nash equilibrium are basic key concepts in game theory. In 1953, Kuhn showed that every sequential game has a Nash equilibrium. The two main steps of ...
Stéphane Le Roux
MFCS
2007
Springer
14 years 12 days ago
Transition Graphs of Rewriting Systems over Unranked Trees
We investigate algorithmic properties of infinite transition graphs that are generated by rewriting systems over unranked trees. Two kinds of such rewriting systems are studied. ...
Christof Löding, Alex Spelten
PODS
2007
ACM
104views Database» more  PODS 2007»
14 years 6 months ago
XML transformation by tree-walking transducers with invisible pebbles
The pebble tree automaton and the pebble tree transducer are enhanced by additionally allowing an unbounded number of `invisible' pebbles (as opposed to the usual `visible�...
Joost Engelfriet, Hendrik Jan Hoogeboom, Bart Samw...