2465 search results - page 430 / 493 » Automata on Linear Orderings |
177
click to vote
INTERSPEECH
2010
15 years 29 days ago
2010
In an attempt to improve models of human perception, the recognition of phonemes in nonsense utterances was predicted with automatic speech recognition (ASR) in order to analyze i...
158
click to vote
JGO
2010
15 years 28 days ago
2010
The best known method to find exact or at least -approximate solutions to polynomial programming problems is the spatial Branch-and-Bound algorithm, which rests on computing lower...
183
click to vote
JMLR
2010
15 years 28 days ago
2010
We show how a preselection of hidden variables can be used to efficiently train generative models with binary hidden variables. The approach is based on Expectation Maximization (...
185
click to vote
JMLR
2010
15 years 28 days ago
2010
We use convex relaxation techniques to provide a sequence of regularized low-rank solutions for large-scale matrix completion problems. Using the nuclear norm as a regularizer, we...
154
click to vote
JMLR
2010
15 years 28 days ago
2010
Virtually all methods of learning dynamic systems from data start from the same basic assumption: the learning algorithm will be given a sequence of data generated from the dynami...