Sciweavers

785 search results - page 78 / 157
» Binary Join Trees
Sort
View
COMGEO
2004
ACM
14 years 9 months ago
Proximity drawings in polynomial area and volume
We introduce a novel technique for drawing proximity graphs in polynomial area and volume. Previously known algorithms produce representations whose size increases exponentially w...
Paolo Penna, Paola Vocca
INTEGRATION
2002
57views more  INTEGRATION 2002»
14 years 9 months ago
To Booth or not to Booth
Booth Recoding is a commonly used technique to recode one of the operands in binary multiplication. In this way the implementation of a multipliers' adder tree can be improve...
Wolfgang J. Paul, Peter-Michael Seidel
BMCBI
2010
135views more  BMCBI 2010»
14 years 10 months ago
GIGA: a simple, efficient algorithm for gene tree inference in the genomic age
Background: Phylogenetic relationships between genes are not only of theoretical interest: they enable us to learn about human genes through the experimental work on their relativ...
Paul D. Thomas
SWAT
1992
Springer
147views Algorithms» more  SWAT 1992»
15 years 1 months ago
Efficient Rebalancing of Chromatic Search Trees
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
Joan Boyar, Kim S. Larsen
DATAMINE
1999
143views more  DATAMINE 1999»
14 years 9 months ago
Partitioning Nominal Attributes in Decision Trees
To find the optimal branching of a nominal attribute at a node in an L-ary decision tree, one is often forced to search over all possible L-ary partitions for the one that yields t...
Don Coppersmith, Se June Hong, Jonathan R. M. Hosk...