Sciweavers

8 search results - page 1 / 2
» Constructing the R* Consensus Tree of Two Trees in Subcubic ...
Sort
View
ESA
2010
Springer
133views Algorithms» more  ESA 2010»
13 years 2 months ago
Constructing the R* Consensus Tree of Two Trees in Subcubic Time
Jesper Jansson, Wing-Kin Sung
ISBRA
2010
Springer
13 years 3 months ago
A Consensus Tree Approach for Reconstructing Human Evolutionary History and Detecting Population Substructure
The random accumulation of variations in the human genome over time implicitly encodes a history of how human populations have arisen, dispersed, and intermixed since we emerged as...
Ming-Chi Tsai, Guy E. Blelloch, R. Ravi, Russell S...
COMCOM
1998
106views more  COMCOM 1998»
13 years 4 months ago
Algorithms for delay-constrained low-cost multicast tree construction
With the proliferation of multimedia group applications, the construction of multicast trees satisfying Quality of Service QoS requirements is becoming a problem of prime import...
R. Sriram, Govindarasu Manimaran, C. Siva Ram Murt...
ICDT
2001
ACM
147views Database» more  ICDT 2001»
13 years 9 months ago
Parallelizing the Data Cube
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one f...
Frank K. H. A. Dehne, Todd Eavis, Susanne E. Hambr...
DAC
2006
ACM
14 years 5 months ago
Timing-driven Steiner trees are (practically) free
Traditionally, rectilinear Steiner minimum trees (RSMT) are widely used for routing estimation in design optimizations like floorplanning and physical synthesis. Since it optimize...
Charles J. Alpert, Andrew B. Kahng, Cliff C. N. Sz...