Sciweavers

1199 search results - page 58 / 240
» Robust inference of trees
Sort
View
118
Voted
AUSAI
1998
Springer
15 years 8 months ago
The Problem of Missing Values in Decision Tree Grafting
Decision tree grafting adds nodes to inferred decision trees. Previous research has demonstrated that appropriate grafting techniques can improve predictive accuracy across a wide ...
Geoffrey I. Webb
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
15 years 3 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
138
Voted
AAAI
2007
15 years 6 months ago
Recognizing Textual Entailment Using a Subsequence Kernel Method
We present a novel approach to recognizing Textual nt. Structural features are constructed from abstract tree descriptions, which are automatically extracted from syntactic depend...
Rui Wang 0005, Günter Neumann
STACS
2005
Springer
15 years 9 months ago
Robust Polynomials and Quantum Algorithms
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
Harry Buhrman, Ilan Newman, Hein Röhrig, Rona...
DATE
2007
IEEE
86views Hardware» more  DATE 2007»
15 years 10 months ago
Thermally robust clocking schemes for 3D integrated circuits
3D integration of multiple active layers into a single chip is a viable technique that greatly reduces the length of global wires by providing vertical connections between layers....
Mosin Mondal, Andrew J. Ricketts, Sami Kirolos, Ta...