Sciweavers

350 search results - page 12 / 70
» Branching Programs for Tree Evaluation
Sort
View
CATA
2004
13 years 9 months ago
Decision Tree Induction for Dynamic, High-Dimensional Data Using P-Trees
1 Decision Tree Induction is a powerful classification tool that is much used in practice and works well for static data with dozens of attributes. We adapt the decision tree conce...
Anne Denton, William Perrizo
SIGMOD
2002
ACM
169views Database» more  SIGMOD 2002»
14 years 7 months ago
Covering indexes for branching path queries
In this paper, we ask if the traditional relational query acceleration techniques of summary tables and covering indexes have analogs for branching path expression queries over tr...
Raghav Kaushik, Philip Bohannon, Jeffrey F. Naught...
INFORMATICALT
2010
103views more  INFORMATICALT 2010»
13 years 2 months ago
Multistage K-Means Clustering for Scenario Tree Construction
Abstract. In stochastic programming and decision analysis, an important issue consists in the approximate representation of the multidimensional stochastic underlying process in th...
Kristina Sutiene, Dalius Makackas, Henrikas Pranev...
CAV
2006
Springer
129views Hardware» more  CAV 2006»
13 years 11 months ago
Languages of Nested Trees
We study languages of nested trees--structures obtained by augmenting trees with sets of nested jump-edges. These graphs can naturally model branching behaviors of pushdown program...
Rajeev Alur, Swarat Chaudhuri, P. Madhusudan
CP
2009
Springer
14 years 8 months ago
Confidence-Based Work Stealing in Parallel Constraint Programming
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
Geoffrey Chu, Christian Schulte, Peter J. Stuckey