Sciweavers

10988 search results - page 1997 / 2198
» Algorithmic Folding Complexity
Sort
View
127
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Scalable robust hypothesis tests using graphical models
Traditional binary hypothesis testing relies on the precise knowledge of the probability density of an observed random vector conditioned on each hypothesis. However, for many app...
Divyanshu Vats, Vishal Monga, Umamahesh Srinivas, ...
180
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Semi-automatic 2D to 3D image conversion using a hybrid Random Walks and graph cuts based approach
In this paper, we present a semi-automated method for converting conventional 2D images to stereoscopic 3D. User-defined strokes that correspond to a rough estimate of the depth ...
Raymond Phan, Richard Rzeszutek, Dimitrios Androut...
156
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Evaluating music sequence models through missing data
Building models of the structure in musical signals raises the question of how to evaluate and compare different modeling approaches. One possibility is to use the model to impute...
Thierry Bertin-Mahieux, Graham Grindlay, Ron J. We...
164
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Interference alignment in single-beam MIMO networks via homotopy continuation
In this paper we consider the application of a homotopy-continuation based method for finding interference alignment (IA) solutions for the deterministic K-user multiple-input mu...
Oscar Gonzalez, Ignacio Santamaría
114
Voted
ICASSP
2011
IEEE
14 years 7 months ago
Powerful extensions to CRFS for grapheme to phoneme conversion
Conditional Random Fields (CRFs) have proven to perform well on natural language processing tasks like name transliteration, concept tagging or grapheme-to-phoneme (g2p) conversio...
Stefan Hahn, Patrick Lehnen, Hermann Ney
« Prev « First page 1997 / 2198 Last » Next »