Sciweavers

44 search results - page 1 / 9
» Basis Reduction, and the Complexity of Branch-and-Bound
Sort
View
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
14 years 1 months ago
Basis Reduction, and the Complexity of Branch-and-Bound
Gabor Pataki, Mustafa Tural
ICCV
1998
IEEE
14 years 6 months ago
Design of Multi-Parameter Steerable Functions Using Cascade Basis Reduction
A new cascade basis reduction method of computing the optimal least-squares set of basis functions to steer a given function locally is presented. The method combines the Lie grou...
Patrick C. Teo, Yacov Hel-Or
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 4 months ago
On Polynomial Multiplication in Chebyshev Basis
In a recent paper Lima, Panario and Wang have provided a new method to multiply polynomials in Chebyshev basis which aims at reducing the total number of multiplication when polyn...
Pascal Giorgi
ICASSP
2011
IEEE
12 years 8 months ago
Are all basis updates for lattice-reduction-aided MIMO detection necessary?
The question in the title is relevant when considering latticereduction-aided MIMO detectors, which achieve the same diversity as the maximum-likelihood detector while exhibiting ...
Brian Gestner, Xiaoli Ma, David V. Anderson
CORR
2006
Springer
156views Education» more  CORR 2006»
13 years 4 months ago
Complex Lattice Reduction Algorithm for Low-Complexity MIMO Detection
Recently, lattice-reduction-aided detectors have been proposed for multiple-input multiple-output (MIMO) systems to give performance with full diversity like maximum likelihood rec...
Ying Hung Gan, Cong Ling, Wai Ho Mow