Sciweavers

141 search results - page 3 / 29
» Bounding basis reduction properties
Sort
View
CISS
2008
IEEE
13 years 11 months ago
Fusion frames and robust dimension reduction
Abstract— We consider the linear minimum meansquared error (LMMSE) estimation of a random vector of interest from its fusion frame measurements in presence noise and subspace era...
Ali Pezeshki, Gitta Kutyniok, A. Robert Calderbank
TOC
2008
94views more  TOC 2008»
13 years 4 months ago
Optimal lower bounds for the Korkine-Zolotareff parameters of a lattice and for Schnorr's algorithm for the shortest vector prob
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
Miklós Ajtai
CORR
2010
Springer
88views Education» more  CORR 2010»
13 years 4 months ago
On the Proximity Factors of Lattice Reduction-Aided Decoding
Lattice reduction-aided decoding enables significant complexity saving and near-optimum performance in multi-input multi-output (MIMO) communications. However, its remarkable perfo...
Cong Ling
CAV
2008
Springer
108views Hardware» more  CAV 2008»
13 years 6 months ago
Reducing Concurrent Analysis Under a Context Bound to Sequential Analysis
This paper addresses the analysis of concurrent programs with shared memory. Such an analysis is undecidable in the presence of multiple procedures. One approach used in recent wor...
Akash Lal, Thomas W. Reps
ECCC
2011
203views ECommerce» more  ECCC 2011»
12 years 8 months ago
Accelerated Slide- and LLL-Reduction
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
Claus-Peter Schnorr