Sciweavers

440 search results - page 8 / 88
» Comparison of Galled Trees
Sort
View
KDD
1997
ACM
86views Data Mining» more  KDD 1997»
14 years 28 days ago
Adjusting for Multiple Comparisons in Decision Tree Pruning
David Jensen, Matthew D. Schmill
SODA
1994
ACM
103views Algorithms» more  SODA 1994»
13 years 10 months ago
Fast Comparison of Evolutionary Trees
Martin Farach, Mikkel Thorup
IPPS
1998
IEEE
14 years 1 months ago
A Survey of Randomness and Parallelism in Comparison Problems
A survey of results for the problems of selection, mergingand sorting in the Randomized Parallel Comparison Tree RPCT model is given. The results indicate that while randomization ...
Danny Krizanc
CLA
2007
13 years 10 months ago
Inducing Decision Trees via Concept Lattices
The paper presents a new method of decision tree induction based on formal concept analysis (FCA). The decision tree is derived using a concept lattice, i.e. a hierarchy of cluster...
Radim Belohlávek, Bernard De Baets, Jan Out...
SODA
2004
ACM
89views Algorithms» more  SODA 2004»
13 years 10 months ago
The number of bit comparisons used by Quicksort: an average-case analysis
The analyses of many algorithms and data structures (such as digital search trees) for searching and sorting are based on the representation of the keys involved as bit strings and...
James Allen Fill, Svante Janson