Sciweavers

3373 search results - page 427 / 675
» Linear transformations on codes
Sort
View
110
Voted
INFOCOM
2003
IEEE
15 years 9 months ago
An information theoretic view of network management
—We present an information-theoretic framework for network management for recovery from nonergodic link failures. Building on recent work in the field of network coding, we desc...
Tracey Ho, Muriel Médard, Ralf Koetter
136
Voted
SIGIR
2010
ACM
15 years 7 months ago
Self-taught hashing for fast similarity search
The ability of fast similarity search at large scale is of great importance to many Information Retrieval (IR) applications. A promising way to accelerate similarity search is sem...
Dell Zhang, Jun Wang, Deng Cai, Jinsong Lu
130
Voted
CORR
2011
Springer
142views Education» more  CORR 2011»
14 years 7 months ago
On the Locality of Codeword Symbols
Consider a linear [n, k, d]q code C. We say that that i-th coordinate of C has locality r, if the value at this coordinate can be recovered from accessing some other r coordinates...
Parikshit Gopalan, Cheng Huang, Huseyin Simitci, S...
154
Voted
COCO
2011
Springer
217views Algorithms» more  COCO 2011»
14 years 3 months ago
Noisy Interpolation of Sparse Polynomials, and Applications
Let f ∈ Fq[x] be a polynomial of degree d ≤ q/2. It is well-known that f can be uniquely recovered from its values at some 2d points even after some small fraction of the valu...
Shubhangi Saraf, Sergey Yekhanin
164
Voted
IJCV
1998
168views more  IJCV 1998»
15 years 3 months ago
Rapid Anisotropic Diffusion Using Space-Variant Vision
Many computer and robot vision applications require multi-scale image analysis. Classically, this has been accomplished through the use of a linear scale-space, which is constructe...
Bruce Fischl, Michael A. Cohen, Eric L. Schwartz