Sciweavers

9 search results - page 1 / 2
» Generalization Bounds for K-Dimensional Coding Schemes in Hi...
Sort
View
66
Voted
ALT
2008
Springer
15 years 7 months ago
Generalization Bounds for K-Dimensional Coding Schemes in Hilbert Spaces
We give a bound on the expected reconstruction error for a general coding method where data in a Hilbert space are represented by finite dimensional coding vectors. The result can...
Andreas Maurer, Massimiliano Pontil
79
Voted
EUROCRYPT
2005
Springer
15 years 3 months ago
Approximate Quantum Error-Correcting Codes and Secret Sharing Schemes
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
Claude Crépeau, Daniel Gottesman, Adam Smit...
CORR
2010
Springer
78views Education» more  CORR 2010»
14 years 10 months ago
On an Outer bound and an Inner Bound for the General Broadcast Channel
In this paper, we study the Nair-El Gamal outer bound and Marton's inner bound for general two-receiver broadcast channels. We show that the Nair-El Gamal outer bound can be m...
Amin Aminzadeh Gohari, Abbas El Gamal, Venkat Anan...
ADCM
2008
111views more  ADCM 2008»
14 years 10 months ago
Sigma-delta quantization errors and the traveling salesman problem
In transmission, storaging and coding of digital signals we frequently perform A/D conversion using quantization. In this paper we study the maxiaml and mean square errors as a res...
Yang Wang
CVPR
2009
IEEE
16 years 5 months ago
Efficient Scale Space Auto-Context for Image Segmentation and Labeling
The Conditional Random Fields (CRF) model, using patch-based classification bound with context information, has recently been widely adopted for image segmentation/ labeling. In...
Jiayan Jiang (UCLA), Zhuowen Tu (UCLA)