Sciweavers

440 search results - page 13 / 88
» Comparison of Galled Trees
Sort
View
ICALP
2010
Springer
14 years 1 months ago
Automata for Coalgebras: An Approach Using Predicate Liftings
Universal Coalgebra provides the notion of a coalgebra as the natural mathematical generalization of state-based evolving systems such as (infinite) words, trees, and transition s...
Gaëlle Fontaine, Raul Andres Leal, Yde Venema
JAR
2010
98views more  JAR 2010»
13 years 3 months ago
Proof-Guided Test Selection from First-Order Specifications with Equality
This paper deals with test case selection from axiomatic specifications whose axioms are quantifier-free first-order formulas with equality. We first prove the existence of an ide...
Delphine Longuet, Marc Aiguier, Pascale Le Gall
LICS
2007
IEEE
14 years 3 months ago
Alternation-free modal mu-calculus for data trees
d abstract) Marcin Jurdzi´nski and Ranko Lazi´c∗ Department of Computer Science, University of Warwick, UK An alternation-free modal µ-calculus over data trees is introduced ...
Marcin Jurdzinski, Ranko Lazic
IJCAI
2001
13 years 10 months ago
Automatically Extracting and Comparing Lexicalized Grammars for Different Languages
In this paper, we present a quantitative comparison between the syntactic structures of three languages: English, Chinese and Korean. This is made possible by first extracting Lex...
Fei Xia, Chung-hye Han, Martha Stone Palmer, Aravi...
KDD
2003
ACM
132views Data Mining» more  KDD 2003»
14 years 9 months ago
PaintingClass: interactive construction, visualization and exploration of decision trees
Decision trees are commonly used for classification. We propose to use decision trees not just for classification but also for the wider purpose of knowledge discovery, because vi...
Soon Tee Teoh, Kwan-Liu Ma