Sciweavers

284 search results - page 32 / 57
» Sensitivity Analysis of the Result in Binary Decision Trees
Sort
View
ML
2006
ACM
163views Machine Learning» more  ML 2006»
13 years 7 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
NAACL
2001
13 years 9 months ago
Re-Engineering Letter-to-Sound Rules
Using finite-state automata for the text analysis component in a text-to-speech system is problematic in several respects: the rewrite rules from which the automata are compiled a...
Martin Jansche
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
13 years 12 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
SEFM
2008
IEEE
14 years 2 months ago
Nullness Analysis in Boolean Form
Attempts to dereference null result in an exception or a segmentation fault. Hence it is important to know those program points where this might occur and prove the others (or the...
Fausto Spoto
ICCAD
2000
IEEE
138views Hardware» more  ICCAD 2000»
14 years 5 days ago
Fast Analysis and Optimization of Power/Ground Networks
This paper presents an efficient method for optimizing power/ground (P/G) networks by widening wires and adding decoupling capacitors (decaps). It proposes a structured skeleton t...
Haihua Su, Kaushik Gala, Sachin S. Sapatnekar