Sciweavers

15 search results - page 3 / 3
» On the second weight of generalized Reed-Muller codes
Sort
View
COCO
2009
Springer
115views Algorithms» more  COCO 2009»
14 years 28 days ago
Locally Testable Codes Require Redundant Testers
Locally testable codes (LTCs) are error-correcting codes for which membership, in the code, of a given word can be tested by examining it in very few locations. Most known constru...
Eli Ben-Sasson, Venkatesan Guruswami, Tali Kaufman...
CASES
2009
ACM
14 years 26 days ago
Optimal loop parallelization for maximizing iteration-level parallelism
This paper solves the open problem of extracting the maximal number of iterations from a loop that can be executed in parallel on chip multiprocessors. Our algorithm solves it opt...
Duo Liu, Zili Shao, Meng Wang, Minyi Guo, Jingling...
STOC
2007
ACM
101views Algorithms» more  STOC 2007»
14 years 6 months ago
The price of privacy and the limits of LP decoding
This work is at the intersection of two lines of research. One line, initiated by Dinur and Nissim, investigates the price, in accuracy, of protecting privacy in a statistical dat...
Cynthia Dwork, Frank McSherry, Kunal Talwar
ESA
2004
Springer
96views Algorithms» more  ESA 2004»
13 years 11 months ago
An Experimental Study of Random Knapsack Problems
The size of the Pareto curve for the bicriteria version of the knapsack problem is polynomial on average. This has been shown for various random input distributions. We experimenta...
René Beier, Berthold Vöcking
NIPS
2007
13 years 7 months ago
A New View of Automatic Relevance Determination
Automatic relevance determination (ARD) and the closely-related sparse Bayesian learning (SBL) framework are effective tools for pruning large numbers of irrelevant features leadi...
David P. Wipf, Srikantan S. Nagarajan