Sciweavers

2354 search results - page 135 / 471
» Radio number for trees
Sort
View
FLAIRS
2010
15 years 8 months ago
Generalized Non-impeding Noisy-AND Trees
To specify a Bayes net (BN), a conditional probability table (CPT), often of an effect conditioned on its n causes, needs assessed for each node. Its complexity is generally expon...
Yang Xiang
CATS
2008
15 years 8 months ago
Generating Balanced Parentheses and Binary Trees by Prefix Shifts
We show that the set Bn of balanced parenthesis strings with n left and n right parentheses can be generated by prefix shifts. If b1, b2, . . . , b2n is a member of Bn, then the k...
Frank Ruskey, Aaron Williams
COLING
2008
15 years 8 months ago
Unsupervised Induction of Labeled Parse Trees by Clustering with Syntactic Features
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
Roi Reichart, Ari Rappoport
NIPS
2007
15 years 7 months ago
Learning with Tree-Averaged Densities and Distributions
We utilize the ensemble of trees framework, a tractable mixture over superexponential number of tree-structured distributions [1], to develop a new model for multivariate density ...
Sergey Kirshner
ICISC
2003
117views Cryptology» more  ICISC 2003»
15 years 7 months ago
Binary Tree Encryption: Constructions and Applications
Binary tree encryption (BTE), a relaxation of hierarchical identity-based encryption (HIBE), has recently emerged as a useful and intriguing primitive. On the one hand, the defini...
Jonathan Katz