Sciweavers

281 search results - page 27 / 57
» Balancing weight-balanced trees
Sort
View
DAC
2005
ACM
14 years 9 months ago
Power optimal dual-Vdd buffered tree considering buffer stations and blockages
This paper presents the first in-depth study on applying dual Vdd buffers to buffer insertion and multi-sink buffered tree construction for power minimization under delay constrai...
King Ho Tam, Lei He
AINA
2007
IEEE
14 years 2 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
PAKDD
2010
ACM
212views Data Mining» more  PAKDD 2010»
14 years 1 months ago
Fast Perceptron Decision Tree Learning from Evolving Data Streams
Abstract. Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffdi...
Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer...
CN
2007
154views more  CN 2007»
13 years 8 months ago
Disjoint multipath routing using colored trees
— Multipath routing (MPR) is an effective strategy to achieve robustness, load balancing, congestion reduction, and increased throughput in computer networks. Disjoint multipath ...
Srinivasan Ramasubramanian, Harish Krishnamoorthy,...
DAC
2008
ACM
14 years 9 months ago
Robust chip-level clock tree synthesis for SOC designs
A key problem that arises in System-on-a-Chip (SOC) designs of today is the Chip-level Clock Tree Synthesis (CCTS). CCTS is done by merging all the clock trees belonging to differ...
Anand Rajaram, David Z. Pan