1364 search results - page 190 / 273 » Sampling Methods for Unsupervised Learning |
105
click to vote
DAC
2005
ACM
16 years 3 months ago
2005
ACM
We present an efficient search strategy for satisfiability checking on circuits represented at the register-transfer-level (RTL). We use the RTL circuit structure by extending con...
157
click to vote
ILP
2004
Springer
15 years 7 months ago
2004
Springer
One challenge faced by many Inductive Logic Programming (ILP) systems is poor scalability to problems with large search spaces and many examples. Randomized search methods such as ...
134
Voted
IJCAI
2001
15 years 3 months ago
2001
Most formulations of Reinforcement Learning depend on a single reinforcement reward value to guide the search for the optimal policy solution. If observation of this reward is rar...
132
Voted
PAA
2008
15 years 2 months ago
2008
This paper presents a novel approach for online subspace learning based on an incremental version of the nonparametric discriminant analysis (NDA). For many real-world applications...
137
click to vote
INTERSPEECH
2010
14 years 9 months ago
2010
In this paper, we propose a novel boosted mixture learning (BML) framework for Gaussian mixture HMMs in speech recognition. BML is an incremental method to learn mixture models fo...