Sciweavers

1245 search results - page 157 / 249
» Binary Sparse Coding
Sort
View
FOCS
1999
IEEE
15 years 7 months ago
Hardness of Approximating the Minimum Distance of a Linear Code
We show that the minimum distance of a linear code is not approximable to within any constant factor in random polynomial time (RP), unless nondeterministic polynomial time (NP) eq...
Ilya Dumer, Daniele Micciancio, Madhu Sudan
POPL
2006
ACM
16 years 3 months ago
Certified assembly programming with embedded code pointers
Embedded code pointers (ECPs) are stored handles of functions and continuations commonly seen in low-level binaries as well as functional or higher-order programs. ECPs are known ...
Zhaozhong Ni, Zhong Shao
CORR
2007
Springer
97views Education» more  CORR 2007»
15 years 3 months ago
Side-information Scalable Source Coding
Abstract—We consider the problem of side-information scalable (SI-scalable) source coding, where the encoder constructs a two-layer description, such that the receiver with high ...
Chao Tian, Suhas N. Diggavi
APIN
2000
120views more  APIN 2000»
15 years 3 months ago
Two-Loop Real-Coded Genetic Algorithms with Adaptive Control of Mutation Step Sizes
Genetic algorithms are adaptive methods based on natural evolution that may be used for search and optimization problems. They process a population of search space solutions with t...
Francisco Herrera, Manuel Lozano
130
Voted
VTC
2010
IEEE
122views Communications» more  VTC 2010»
15 years 1 months ago
Generalized MIMO Transmit Preprocessing Using Pilot Symbol Assisted Rateless Codes
In this paper, we propose a generalized multiple-input multiple-output (MIMO) transmit preprocessing system, where both the channel coding and the linear MIMO transmit precoding c...
Nicholas Bonello, Du Yang, Shen Chen, Lajos Hanzo