Sciweavers

3096 search results - page 66 / 620
» Theory and Use of the EM Algorithm
Sort
View
NIPS
2001
15 years 2 months ago
The Concave-Convex Procedure (CCCP)
We introduce the Concave-Convex procedure (CCCP) which constructs discrete time iterative dynamical systems which are guaranteed to monotonically decrease global optimization/ener...
Alan L. Yuille, Anand Rangarajan
ICASSP
2010
IEEE
15 years 1 months ago
Latent-variable decomposition based dereverberation of monaural and multi-channel signals
We present an algorithm to dereverberate single- and multi-channel audio recordings. The proposed algorithm models the magnitude spectrograms of clean audio signals as histograms ...
Rita Singh, Bhiksha Raj, Paris Smaragdis
SYNASC
2007
IEEE
105views Algorithms» more  SYNASC 2007»
15 years 7 months ago
Decompositions of Natural Numbers: From a Case Study in Mathematical Theory Exploration
In this technical report we present the proofs of properties appearing when solving the problem of prime decomposition of natural numbers using a scheme-based systematic exploratio...
Adrian Craciun, Madalina Hodorog
IPM
2008
102views more  IPM 2008»
15 years 1 months ago
Fast exact maximum likelihood estimation for mixture of language model
Language modeling is an effective and theoretically attractive probabilistic framework for text information retrieval. The basic idea of this approach is to estimate a language mo...
Yi Zhang 0001, Wei Xu
COCO
2007
Springer
75views Algorithms» more  COCO 2007»
15 years 7 months ago
On the Theory of Matchgate Computations
Valiant has proposed a new theory of algorithmic computation based on perfect matchings and Pfaffians. We study the properties of matchgates—the basic building blocks in this n...
Jin-yi Cai, Vinay Choudhary, Pinyan Lu