Sciweavers

1014 search results - page 136 / 203
» A Spectral Algorithm for Learning Hidden Markov Models
Sort
View
ICIAP
2009
ACM
14 years 8 months ago
A New Generative Feature Set Based on Entropy Distance for Discriminative Classification
Abstract. Score functions induced by generative models extract fixeddimensions feature vectors from different-length data observations by subsuming the process of data generation, ...
Alessandro Perina, Marco Cristani, Umberto Castell...
TASLP
2010
138views more  TASLP 2010»
13 years 2 months ago
Glimpsing IVA: A Framework for Overcomplete/Complete/Undercomplete Convolutive Source Separation
Abstract--Independent vector analysis (IVA) is a method for separating convolutedly mixed signals that significantly reduces the occurrence of the well-known permutation problem in...
Alireza Masnadi-Shirazi, Wenyi Zhang, Bhaskar D. R...
ICML
2003
IEEE
14 years 8 months ago
Exploration in Metric State Spaces
We present metric?? , a provably near-optimal algorithm for reinforcement learning in Markov decision processes in which there is a natural metric on the state space that allows t...
Sham Kakade, Michael J. Kearns, John Langford
JCB
2002
116views more  JCB 2002»
13 years 7 months ago
A Novel Approach to Remote Homology Detection: Jumping Alignments
We describe a new algorithm for protein classi cation and the detection of remote homologs. The rationale is to exploit both vertical and horizontal information of a multiple alig...
Rainer Spang, Marc Rehmsmeier, Jens Stoye
PERCOM
2007
ACM
14 years 7 months ago
Sensor Scheduling for Optimal Observability Using Estimation Entropy
We consider sensor scheduling as the optimal observability problem for partially observable Markov decision processes (POMDP). This model fits to the cases where a Markov process ...
Mohammad Rezaeian