Sciweavers

291 search results - page 3 / 59
» Approximate centerpoints with proofs
Sort
View
JAT
2010
61views more  JAT 2010»
13 years 8 months ago
Close-to-optimal bounds for SU(N) loop approximation
In [6], we proved an asymptotic O(n−α/(α+1)) bound for the approximation of SU(N) loops (N ≥ 2) with Lipschitz smoothness α > 1/2 by polynomial loops of degree ≤ n. Th...
Peter Oswald, Tatiana Shingel
CORR
2011
Springer
152views Education» more  CORR 2011»
13 years 5 months ago
Sparsity Equivalence of Anisotropic Decompositions
Anisotropic decompositions using representation systems such as curvelets, contourlet, or shearlets have recently attracted significantly increased attention due to the fact that...
Gitta Kutyniok
PROPERTYTESTING
2010
13 years 8 months ago
Short Locally Testable Codes and Proofs: A Survey in Two Parts
We survey known results regarding locally testable codes and locally testable proofs (known as PCPs), with emphasis on the length of these constructs. Local testability refers to a...
Oded Goldreich
ICASSP
2011
IEEE
13 years 2 months ago
Gaussian approximation of the LLR distribution for the ML and partial marginalization MIMO detectors
We derive a Gaussian approximation of the LLR distribution conditioned on the transmitted signal and the channel matrix for the soft-output via partial marginalization MIMO detect...
Mirsad Cirkic, Daniel Persson, Erik G. Larsson, Ja...
SIGECOM
2011
ACM
232views ECommerce» more  SIGECOM 2011»
13 years 1 months ago
Near optimal online algorithms and fast approximation algorithms for resource allocation problems
We present algorithms for a class of resource allocation problems both in the online setting with stochastic input and in the offline setting. This class of problems contains man...
Nikhil R. Devanur, Kamal Jain, Balasubramanian Siv...