Sciweavers

99 search results - page 14 / 20
» Learning Hidden Markov Models with Distributed State Represe...
Sort
View
JMLR
2010
202views more  JMLR 2010»
14 years 10 months ago
Learning the Structure of Deep Sparse Graphical Models
Deep belief networks are a powerful way to model complex probability distributions. However, it is difficult to learn the structure of a belief network, particularly one with hidd...
Ryan Prescott Adams, Hanna M. Wallach, Zoubin Ghah...
134
Voted
ML
2000
ACM
150views Machine Learning» more  ML 2000»
15 years 3 months ago
Adaptive Retrieval Agents: Internalizing Local Context and Scaling up to the Web
This paper discusses a novel distributed adaptive algorithm and representation used to construct populations of adaptive Web agents. These InfoSpiders browse networked information ...
Filippo Menczer, Richard K. Belew
143
Voted
CVPR
2012
IEEE
13 years 6 months ago
Discrete texture traces: Topological representation of geometric context
Modeling representations of image patches that are quasi-invariant to spatial deformations is an important problem in computer vision. In this paper, we propose a novel concept, t...
Jan Ernst, Maneesh Kumar Singh, Visvanathan Ramesh
156
Voted
ICASSP
2011
IEEE
14 years 7 months ago
An investigation of subspace modeling for phonetic and speaker variability in automatic speech recognition
This paper investigates the impact of subspace based techniques for acoustic modeling in automatic speech recognition (ASR). There are many well known approaches to subspace based...
Richard C. Rose, Shou-Chun Yin, Yun Tang
118
Voted
TNN
1998
123views more  TNN 1998»
15 years 3 months ago
A general framework for adaptive processing of data structures
—A structured organization of information is typically required by symbolic processing. On the other hand, most connectionist models assume that data are organized according to r...
Paolo Frasconi, Marco Gori, Alessandro Sperduti