Sciweavers

785 search results - page 91 / 157
» Binary Join Trees
Sort
View
KDD
2004
ACM
126views Data Mining» more  KDD 2004»
15 years 10 months ago
Turning CARTwheels: an alternating algorithm for mining redescriptions
We present an unusual algorithm involving classification trees-CARTwheels--where two trees are grown in opposite directions so that they are joined at their leaves. This approach ...
Naren Ramakrishnan, Deept Kumar, Bud Mishra, Malco...
WDAG
2009
Springer
154views Algorithms» more  WDAG 2009»
15 years 4 months ago
Compact Multicast Routing
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Ittai Abraham, Dahlia Malkhi, David Ratajczak
GECCO
2005
Springer
150views Optimization» more  GECCO 2005»
15 years 3 months ago
A GA for maximum likelihood phylogenetic inference using neighbour-joining as a genotype to phenotype mapping
Evolutionary relationships among species can be represented by a phylogenetic tree and inferred by optimising some measure of fitness, such as the statistical likelihood of the t...
Leon Poladian
BIBE
2003
IEEE
15 years 3 months ago
An Investigation of Phylogenetic Likelihood Methods
Abstract— We analyze the performance of likelihoodbased approaches used to reconstruct phylogenetic trees. Unlike other techniques such as Neighbor-Joining (NJ) and Maximum Parsi...
Tiffani L. Williams, Bernard M. E. Moret
INFOCOM
2000
IEEE
15 years 2 months ago
A QoS-Aware Multicast Routing Protocol
—The future Internet is expected to support multicast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in ...
Shigang Chen, Klara Nahrstedt, Yuval Shavitt