Sciweavers

502 search results - page 33 / 101
» Verifying Balanced Trees
Sort
View
PAKDD
2010
ACM
212views Data Mining» more  PAKDD 2010»
14 years 3 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 11 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 12 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
ICML
2010
IEEE
14 years 14 hour ago
Tree-Guided Group Lasso for Multi-Task Regression with Structured Sparsity
We consider the problem of learning a sparse multi-task regression, where the structure in the outputs can be represented as a tree with leaf nodes as outputs and internal nodes a...
Seyoung Kim, Eric P. Xing
SBACPAD
2006
IEEE
148views Hardware» more  SBACPAD 2006»
14 years 5 months ago
Scalable Parallel Implementation of Bayesian Network to Junction Tree Conversion for Exact Inference
We present a scalable parallel implementation for converting a Bayesian network to a junction tree, which can then be used for a complete parallel implementation for exact inferen...
Vasanth Krishna Namasivayam, Animesh Pathak, Vikto...