Sciweavers

1243 search results - page 30 / 249
» Generating Trees on Multisets
Sort
View
ESAS
2004
Springer
14 years 3 months ago
Pseudonym Generation Scheme for Ad-Hoc Group Communication Based on IDH
In this paper we describe the advantages of using iterative Diffie-Hellman (IDH) key trees for mobile ad-hoc group communication. We focus on the Treebased Group Diffie-Hellman (...
Mark Manulis, Jörg Schwenk
ICASSP
2011
IEEE
13 years 1 months ago
Automatic minute generation for parliamentary speech using conditional random fields
We show a novel approach of automatically generating minutes style extractive summaries for parliamentary speech. Minutes are structured summaries consisting of sequences of busin...
Justin Jian Zhang, Pascale Fung, Ricky Ho Yin Chan
ICML
2004
IEEE
14 years 10 months ago
Lookahead-based algorithms for anytime induction of decision trees
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch
EVOW
2010
Springer
14 years 4 months ago
Top-Down Induction of Phylogenetic Trees
We propose a novel distance based method for phylogenetic tree reconstruction. Our method is based on a conceptual clustering method that extends the well-known decision tree learn...
Celine Vens, Eduardo Costa, Hendrik Blockeel
AAAI
2006
13 years 11 months ago
When a Decision Tree Learner Has Plenty of Time
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
Saher Esmeir, Shaul Markovitch