Sciweavers

2945 search results - page 243 / 589
» Noisy Network Coding
Sort
View
CVPR
2010
IEEE
15 years 9 months ago
Robust Order-based Methods for Feature Description
Feature-based methods have found increasing use in many applications such as object recognition, 3D reconstruction and mosaicing. In this paper, we focus on the problem of matchin...
Raj Gupta, Anurag Mittal, Harshal Patil
SLSFS
2005
Springer
15 years 9 months ago
Auxiliary Variational Information Maximization for Dimensionality Reduction
Abstract. Mutual Information (MI) is a long studied measure of information content, and many attempts to apply it to feature extraction and stochastic coding have been made. Howeve...
Felix V. Agakov, David Barber
CORR
2006
Springer
100views Education» more  CORR 2006»
15 years 4 months ago
How to beat the sphere-packing bound with feedback
The sphere-packing bound Esp(R) bounds the reliability function for fixed-length block-codes. For symmetric channels, it remains a valid bound even when strictly causal noiseless ...
Anant Sahai
JAIR
2006
137views more  JAIR 2006»
15 years 4 months ago
Learning Sentence-internal Temporal Relations
In this paper we propose a data intensive approach for inferring sentence-internal temporal relations. Temporal inference is relevant for practical NLP applications which either e...
Maria Lapata, Alex Lascarides
CORR
2010
Springer
126views Education» more  CORR 2010»
14 years 11 months ago
Reed Muller Sensing Matrices and the LASSO
We construct two families of deterministic sensing matrices where the columns are obtained by exponentiating codewords in the quaternary Delsarte-Goethals code DG(m, r). This meth...
A. Robert Calderbank, Sina Jafarpour