Sciweavers

406 search results - page 33 / 82
» Boosting Using Branching Programs
Sort
View
EICS
2010
ACM
15 years 5 months ago
Using ensembles of decision trees to automate repetitive tasks in web applications
Web applications such as web-based email, spreadsheets and form filling applications have become ubiquitous. However, many of the tasks that users try to accomplish with such web ...
Zachary Bray, Per Ola Kristensson
116
Voted
TLDI
2010
ACM
218views Formal Methods» more  TLDI 2010»
15 years 9 months ago
Pointwise generalized algebraic data types
In the GADT (Generalized Algebraic Data Types) type system, a pattern-matching branch can draw type information from both the scrutinee type and the data constructor type. Even th...
Chuan-kai Lin, Tim Sheard
129
Voted
MCS
2009
Springer
15 years 5 months ago
Random Ordinality Ensembles A Novel Ensemble Method for Multi-valued Categorical Data
Abstract. Data with multi-valued categorical attributes can cause major problems for decision trees. The high branching factor can lead to data fragmentation, where decisions have ...
Amir Ahmad, Gavin Brown
ISCA
2000
IEEE
111views Hardware» more  ISCA 2000»
15 years 4 months ago
Understanding the backward slices of performance degrading instructions
For many applications, branch mispredictions and cache misses limit a processor’s performance to a level well below its peak instruction throughput. A small fraction of static i...
Craig B. Zilles, Gurindar S. Sohi
150
Voted
WEA
2010
Springer
289views Algorithms» more  WEA 2010»
15 years 7 months ago
Experiments with a Generic Dantzig-Wolfe Decomposition for Integer Programs
Abstract We report on experiments with turning the branch-price-andcut framework SCIP into a generic branch-price-and-cut solver. That is, given a mixed integer program (MIP), our ...
Gerald Gamrath, Marco E. Lübbecke