Sciweavers

52 search results - page 6 / 11
» Decoding Turbo-Like Codes via Linear Programming
Sort
View
ICALP
2005
Springer
14 years 1 months ago
Improved Lower Bounds for Locally Decodable Codes and Private Information Retrieval
We prove new lower bounds for locally decodable codes and private information retrieval. We show that a 2-query LDC encoding nbit strings over an ℓ-bit alphabet, where the decode...
Stephanie Wehner, Ronald de Wolf
GECCO
2003
Springer
114views Optimization» more  GECCO 2003»
14 years 25 days ago
A Linear Genetic Programming Approach to Intrusion Detection
Abstract. Page-based Linear Genetic Programming (GP) is proposed and implemented with two-layer Subset Selection to address a two-class intrusion detection classification problem a...
Dong Song, Malcolm I. Heywood, A. Nur Zincir-Heywo...
CISS
2008
IEEE
14 years 2 months ago
Near optimal lossy source coding and compression-based denoising via Markov chain Monte Carlo
— We propose an implementable new universal lossy source coding algorithm. The new algorithm utilizes two wellknown tools from statistical physics and computer science: Gibbs sam...
Shirin Jalali, Tsachy Weissman
CORR
2007
Springer
104views Education» more  CORR 2007»
13 years 7 months ago
Searching for low weight pseudo-codewords
— Belief Propagation (BP) and Linear Programming (LP) decodings of Low Density Parity Check (LDPC) codes are discussed. We summarize results of instanton/pseudo-codeword approach...
Michael Chertkov, Mikhail G. Stepanov
CC
2008
Springer
133views System Software» more  CC 2008»
13 years 7 months ago
Hardness Amplification via Space-Efficient Direct Products
We prove a version of the derandomized Direct Product lemma for deterministic space-bounded algorithms. Suppose a Boolean function g : {0, 1}n {0, 1} cannot be computed on more th...
Venkatesan Guruswami, Valentine Kabanets