Sciweavers

901 search results - page 17 / 181
» Analyzing linear mergers
Sort
View
PDPTA
1996
13 years 9 months ago
Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network
This paper describes a parallelization of the sequential dynamic programming method for solving a 2D knapsack problem where multiples of n rectangular objects are optimally packed...
Darrell R. Ulm, Johnnie W. Baker
TASLP
2010
153views more  TASLP 2010»
13 years 6 months ago
On Optimal Frequency-Domain Multichannel Linear Filtering for Noise Reduction
Abstract—Several contributions have been made so far to develop optimal multichannel linear filtering approaches and show their ability to reduce the acoustic noise. However, th...
Mehrez Souden, Jacob Benesty, Sofiène Affes
CORR
2012
Springer
225views Education» more  CORR 2012»
12 years 4 months ago
Compressive Principal Component Pursuit
We consider the problem of recovering a target matrix that is a superposition of low-rank and sparse components, from a small set of linear measurements. This problem arises in co...
John Wright, Arvind Ganesh, Kerui Min, Yi Ma
JMLR
2012
11 years 11 months ago
Message-Passing Algorithms for MAP Estimation Using DC Programming
We address the problem of finding the most likely assignment or MAP estimation in a Markov random field. We analyze the linear programming formulation of MAP through the lens of...
Akshat Kumar, Shlomo Zilberstein, Marc Toussaint
CORR
2011
Springer
163views Education» more  CORR 2011»
13 years 3 months ago
On Conditions for Linearity of Optimal Estimation
—When is optimal estimation linear? It is well-known that, in the case of a Gaussian source contaminated with Gaussian noise, a linear estimator minimizes the mean square estimat...
Emrah Akyol, Kumar Viswanatha, Kenneth Rose