Sciweavers

256 search results - page 21 / 52
» Short trees in polygons
Sort
View
CORR
2010
Springer
75views Education» more  CORR 2010»
13 years 3 months ago
Treemaps with Bounded Aspect Ratio
Treemaps are a popular technique to visualize hierarchical data. The input is a weighted tree T where the weight of each node is the sum of the weights of its children. A treemap ...
Mark de Berg, Bettina Speckmann, Vincent van der W...
ICC
2007
IEEE
14 years 3 months ago
A Fast Broadcast Tree Construction in Multi-Rate Wireless Mesh Networks
— One of the wireless mesh network’s important features is each node can support more than one transmission rate. However, few previous literatures on the broadcast tree constr...
Tai Wang, Xu Du, Wenqing Cheng, Zongkai Yang, Wei ...
DMIN
2009
223views Data Mining» more  DMIN 2009»
13 years 6 months ago
Are Decision Trees Always Greener on the Open (Source) Side of the Fence?
- This short paper compares the performance of three popular decision tree algorithms: C4.5, C5.0, and WEKA's J48. These decision tree algorithms are all related in that C5.0 ...
Samuel Moore, Daniel D'Addario, James Kurinskas, G...
COCOON
1999
Springer
14 years 28 days ago
Multi-coloring Trees
Scheduling jobs with pairwise conflicts is modeled by the graph multicoloring problem. It occurs in two versions: in the preemptive case, each vertex may get any set of colors, w...
Magnús M. Halldórsson, Guy Kortsarz,...
BMCBI
2010
142views more  BMCBI 2010»
13 years 8 months ago
pplacer: linear time maximum-likelihood and Bayesian phylogenetic placement of sequences onto a fixed reference tree
Background: Likelihood-based phylogenetic inference is generally considered to be the most reliable classification method for unknown sequences. However, traditional likelihood-ba...
Frederick A. Matsen III, Robin B. Kodner, E. Virgi...