Sciweavers

373 search results - page 51 / 75
» An ACO Algorithm for the Most Probable Explanation Problem
Sort
View
NIPS
2008
13 years 9 months ago
Clusters and Coarse Partitions in LP Relaxations
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
David Sontag, Amir Globerson, Tommi Jaakkola
TMM
2008
126views more  TMM 2008»
13 years 7 months ago
Extraction of Audio Features Specific to Speech Production for Multimodal Speaker Detection
A method that exploits an information theoretic framework to extract optimized audio features using video information is presented. A simple measure of mutual information (MI) betw...
Patricia Besson, Vlad Popovici, Jean-Marc Vesin, J...
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
14 years 1 days ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
JBI
2008
137views Bioinformatics» more  JBI 2008»
13 years 8 months ago
Mining sequential patterns for protein fold recognition
Protein data contain discriminative patterns that can be used in many beneficial applications if they are defined correctly. In this work sequential pattern mining (SPM) is utiliz...
Themis P. Exarchos, Costas Papaloukas, Christos La...
PAMI
2008
302views more  PAMI 2008»
13 years 8 months ago
Learning to Detect Moving Shadows in Dynamic Environments
We propose a novel adaptive technique for detecting moving shadows and distinguishing them from moving objects in video sequences. Most methods for detecting shadows work in a stat...
Ajay J. Joshi, Nikolaos Papanikolopoulos