Sciweavers

193 search results - page 11 / 39
» Sparseness Achievement in Hidden Markov Models
Sort
View
ICML
2009
IEEE
14 years 10 months ago
On primal and dual sparsity of Markov networks
Sparsity is a desirable property in high dimensional learning. The 1-norm regularization can lead to primal sparsity, while max-margin methods achieve dual sparsity. Combining the...
Jun Zhu, Eric P. Xing
IMCSIT
2010
13 years 4 months ago
Development of a Voice Control Interface for Navigating Robots and Evaluation in Outdoor Environments
In this paper the development of a prototypic mobile voice control for navigating autonomous robots within a multi robot system is described. As basis for the voice control a hidde...
Ravi Coote
JMLR
2010
157views more  JMLR 2010»
13 years 4 months ago
Why are DBNs sparse?
Real stochastic processes operating in continuous time can be modeled by sets of stochastic differential equations. On the other hand, several popular model families, including hi...
Shaunak Chatterjee, Stuart Russell
ICASSP
2011
IEEE
13 years 1 months ago
Subspace pursuit method for kernel-log-linear models
This paper presents a novel method for reducing the dimensionality of kernel spaces. Recently, to maintain the convexity of training, loglinear models without mixtures have been u...
Yotaro Kubo, Simon Wiesler, Ralf Schlüter, He...
ICCV
2009
IEEE
1048views Computer Vision» more  ICCV 2009»
15 years 2 months ago
Face Recognition With Contiguous Occlusion Using Markov Random Fields
Partially occluded faces are common in many applications of face recognition. While algorithms based on sparse representation have demonstrated promising results, they achieve t...
Zihan Zhou, Andrew Wagner, Hossein Mobahi, John Wr...