Sciweavers

841 search results - page 65 / 169
» Approximability of Minimum AND-Circuits
Sort
View
TWC
2010
13 years 4 months ago
Reduced-Complexity Joint Baseband Compensation of Phase Noise and I/Q Imbalance for MIMO-OFDM Systems
The maximum likelihood estimate of the impulse response of a frequency-selective channel in the presence of phase noise and I/Q imbalance is derived. The complexity of the joint es...
Rabie Rabiei, Won Namgoong, Naofal Al-Dhahir
ICASSP
2011
IEEE
13 years 1 months ago
Computing the nonnegative 3-way tensor factorization using Tikhonov regularization
This paper deals with the minimum polyadic decomposition of a nonnegative three-way array. The main advantage of the nonnegativity constraint is that the approximation problem bec...
Jean-Philip Royer, Pierre Comon, Nadège Thi...
ICASSP
2011
IEEE
13 years 1 months ago
Generalizations of Blom And Bloem's PDF decomposition for permutation-invariant estimation
Minimum mean squared error estimates generally are not optimal in terms of a common track error statistic used in tracking benchmarks, namely a form of the Mean Optimal Subpattern...
David Frederic Crouse, Peter Willett, Yaakov Bar-S...
COCOON
2009
Springer
14 years 4 months ago
On Finding Small 2-Generating Sets
Given a set of positive integers S, we consider the problem of finding a minimum cardinality set of positive integers X (called a minimum 2-generating set of S) s.t. every element...
Isabelle Fagnot, Guillaume Fertin, Stéphane...
COCO
2009
Springer
119views Algorithms» more  COCO 2009»
14 years 4 months ago
An Approximation Algorithm for Approximation Rank
One of the strongest techniques available for showing lower bounds on quantum communication complexity is the logarithm of the approximation rank of the communication matrix— th...
Troy Lee, Adi Shraibman