3250 search results - page 120 / 650 » Parameterized Learning Complexity |
122
click to vote
ETS
2000
IEEE
15 years 2 months ago
2000
IEEE
The paper provides an insight into the changing nature of the learning process through the adoption of interactive new media solutions into a traditional University Campus. The us...
137
Voted
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
In this paper, we investigate a simple, mistakedriven learning algorithm for discriminative training of continuous density hidden Markov models (CD-HMMs). Most CD-HMMs for automat...
116
click to vote
CADE
2006
Springer
16 years 2 months ago
2006
Springer
Abstract. Verification by network invariants is a heuristic to solve uniform verification of parameterized systems. Given a system P, a network invariant for P is that abstracts th...
113
click to vote
ACL
2008
15 years 4 months ago
2008
Parse-tree paths are commonly used to incorporate information from syntactic parses into NLP systems. These systems typically treat the paths as atomic (or nearly atomic) features...
140
click to vote
NIPS
2008
15 years 3 months ago
2008
We present a mixture model whose components are Restricted Boltzmann Machines (RBMs). This possibility has not been considered before because computing the partition function of a...