Sciweavers

2492 search results - page 104 / 499
» On the General Signature Trees
Sort
View
NIPS
2003
15 years 7 months ago
Semi-Supervised Learning with Trees
We describe a nonparametric Bayesian approach to generalizing from few labeled examples, guided by a larger set of unlabeled objects and the assumption of a latent tree-structure ...
Charles Kemp, Thomas L. Griffiths, Sean Stromsten,...
AI
2007
Springer
15 years 6 months ago
Determining the consistency of partial tree descriptions
We present an efficient algorithm that checks the consistency of partial descriptions of ordered trees. The constraint language of these descriptions was introduced by Cornell in c...
Manuel Bodirsky, Martin Kutz
SIGECOM
2009
ACM
109views ECommerce» more  SIGECOM 2009»
16 years 27 days ago
A new perspective on implementation by voting trees
Voting trees describe an iterative procedure for selecting a single vertex from a tournament. vide a very general abstract model of decision-making among a group of individuals, a...
Felix A. Fischer, Ariel D. Procaccia, Alex Samorod...
LICS
2002
IEEE
15 years 11 months ago
Tree Extension Algebras: Logics, Automata, and Query Languages
We study relations on trees defined by first-order constraints over a vocabulary that includes the tree extension relation Ì Ì ¼, holding if and only if every branch of Ì ex...
Michael Benedikt, Leonid Libkin
ICCD
1997
IEEE
87views Hardware» more  ICCD 1997»
15 years 10 months ago
Synthesizing Iterative Functions into Delay-Insensitive Tree Circuits
Speed, cost and correctness may be the most important factors in designing a digital system. This paper proposes a novel and general methodology to synthesize iterative functions ...
Fu-Chiung Cheng