Sciweavers

1836 search results - page 105 / 368
» Hierarchies for semantic classes
Sort
View
ICML
2003
IEEE
15 years 10 months ago
Probabilistic Classifiers and the Concepts They Recognize
We investigate algebraic, logical, and geometric properties of concepts recognized by various classes of probabilistic classifiers. For this we introduce a natural hierarchy of pr...
Manfred Jaeger
LICS
2007
IEEE
15 years 4 months ago
A Contraction Method to Decide MSO Theories of Deterministic Trees
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
Angelo Montanari, Gabriele Puppis
CSL
2007
Springer
15 years 4 months ago
Forest Expressions
We define regular expressions for unranked trees (actually, ordered sequences of unranked trees, called forests). These are compared to existing regular expressions for trees. On ...
Mikolaj Bojanczyk
WCRE
2005
IEEE
15 years 3 months ago
Toward an Infrastructure to Support Interoperability in Reverse Engineering
In this paper we present an infrastructure that supports interoperability among various reverse engineering tools and applications. We include an Application Programmer’s Interf...
Nicholas A. Kraft, Brian A. Malloy, James F. Power
SODA
2004
ACM
91views Algorithms» more  SODA 2004»
14 years 11 months ago
Competitive analysis of organization networks or multicast acknowledgement: how much to wait?
We study, from the competitive analysis perspective, the trade off between communication cost and delay cost (or simply the sendor-wait dilemma) on a hierarchy (rooted tree). The p...
Carlos Brito, Elias Koutsoupias, Shailesh Vaya