Sciweavers

531 search results - page 6 / 107
» A Better Algorithm for Random k-SAT
Sort
View
ISPD
2012
ACM
289views Hardware» more  ISPD 2012»
13 years 7 months ago
Keep it straight: teaching placement how to better handle designs with datapaths
As technology scales and frequency increases, a new design style is emerging, referred to as hybrid designs, which contain a mixture of random logic and datapath standard cell com...
Samuel I. Ward, Myung-Chul Kim, Natarajan Viswanat...
86
Voted
STOC
2004
ACM
134views Algorithms» more  STOC 2004»
15 years 12 months ago
Better extractors for better codes?
We present an explicit construction of codes that can be list decoded from a fraction (1 - ) of errors in sub-exponential time and which have rate / logO(1) (1/). This comes close...
Venkatesan Guruswami
CRYPTO
2011
Springer
235views Cryptology» more  CRYPTO 2011»
13 years 11 months ago
Better Security for Deterministic Public-Key Encryption: The Auxiliary-Input Setting
Deterministic public-key encryption, introduced by Bellare, Boldyreva, and O’Neill (CRYPTO ’07), provides an alternative to randomized public-key encryption in various scenari...
Zvika Brakerski, Gil Segev
IPL
2000
146views more  IPL 2000»
14 years 11 months ago
Better approximations for max TSP
We combine two known polynomial time approximation algorithms for the maximum traveling salesman problem to obtain a randomized algorithm which outputs a solution with expected va...
Refael Hassin, Shlomi Rubinstein
CORR
2004
Springer
140views Education» more  CORR 2004»
14 years 11 months ago
Better algorithms for unfair metrical task systems and applications
Unfair metrical task systems are a generalization of online metrical task systems. In this paper we introduce new techniques to combine algorithms for unfair metrical task systems...
Amos Fiat, Manor Mendel