Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
RSA
2006
63views more  RSA 2006»
12 years 5 months ago
Random cutting and records in deterministic and random trees
We study random cutting down of a rooted tree and show that the number of cuts is equal (in distribution) to the number of records in the tree when edges (or vertices) are assigned...
Svante Janson
ICGI
2000
Springer
12 years 9 months ago
Constructive Learning of Context-Free Languages with a Subpansive Tree
A subpansive tree is a rooted tree that gives a partial order of nonterminal symbols of a context-free grammar. We formalize subpansive trees as background knowledge of CFGs, and i...
Noriko Sugimoto, Takashi Toyoshima, Shinichi Shimo...
CRYPTO
1999
Springer
152views Cryptology» more  CRYPTO 1999»
12 years 10 months ago
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
Several variations of rooted tree based solutions have been recently proposed for member revocation in multicast communications [18, 19, 20, 21]. In this paper, we show that by ass...
Radha Poovendran, John S. Baras
CSB
2003
IEEE
130views Bioinformatics» more  CSB 2003»
12 years 11 months ago
Latent Structure Models for the Analysis of Gene Expression Data
Cluster methods have been successfully applied in gene expression data analysis to address tumor classiļ¬cation. By grouping tissue samples into homogeneous subsets, more systema...
Dong Hua, Dechang Chen, Xiuzhen Cheng, Abdou Youss...
books