2912 search results - page 362 / 583 » Logistic Model Trees |
136
click to vote
ISAAC
2004
Springer
15 years 9 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
123
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We consider a model of learning Boolean functions from examples generated by a uniform random walk on {0, 1}n . We give a polynomial time algorithm for learning decision trees and...
144
click to vote
DAC
1999
ACM
15 years 8 months ago
1999
ACM
Buffer insertion has become a critical step in deep submicron design, and several buffer insertion/sizing algorithms have been proposed in the literature. However, most of these m...
144
click to vote
AUSAI
2006
Springer
15 years 8 months ago
2006
Springer
Abstract. We use a Markov Chain Monte Carlo (MCMC) MML algorithm to learn hybrid Bayesian networks from observational data. Hybrid networks represent local structure, using conditi...
127
click to vote
EACL
2006
ACL Anthology
15 years 5 months ago
2006
ACL Anthology
We present a model for sentence compression that uses a discriminative largemargin learning framework coupled with a novel feature set defined on compressed bigrams as well as dee...