Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

114

SODA
2010
ACM

178views Algorithms» more SODA 2010»

Basis Reduction, and the Complexity of Branch-and-Bound

16 years 4 days ago

Basis Reduction, and the Complexity of Branch-and-Bound

Download www.unc.edu

Gabor Pataki, Mustafa Tural

Real-time Traffic

Basis Reduction | Discrete Algorithms | SODA 2010 |

claim paper

Related Content

» Design of MultiParameter Steerable Functions Using Cascade Basis Reduction

» On Polynomial Multiplication in Chebyshev Basis

» Are all basis updates for latticereductionaided MIMO detection necessary

» Complex Lattice Reduction Algorithm for LowComplexity MIMO Detection

» A LatticeReductionAided Soft Detector for MultipleInput MultipleOutput Channels

» Rapid Speaker Adaptation Using Clustered MaximumLikelihood Linear Basis With Sparse Traini...

» On the Complexity of Computing Short Linearly Independent Vectors and Short Bases in a Lat...

» Morphological and predictability effects on schwa reduction the case of dutch wordinitial ...

» Efficient latticereductionaided MMSE decisionfeedback equalization

Post Info
More Details (n/a)

Added	01 Mar 2010
Updated	02 Mar 2010
Type	Conference
Year	2010
Where	SODA
Authors	Gabor Pataki, Mustafa Tural

Comments (0)