Sciweavers

2069 search results - page 79 / 414
» Linear time algorithms for Clobber
Sort
View
TIT
2008
122views more  TIT 2008»
15 years 6 months ago
An Efficient Pseudocodeword Search Algorithm for Linear Programming Decoding of LDPC Codes
Abstract--In linear programming (LP) decoding of a low-density parity-check (LDPC) code one minimizes a linear functional, with coefficients related to log-likelihood ratios, over ...
Michael Chertkov, Mikhail G. Stepanov
DAC
2007
ACM
16 years 7 months ago
RQL: Global Placement via Relaxed Quadratic Spreading and Linearization
This paper describes a simple and effective quadratic placement algorithm called RQL. We show that a good quadratic placement, followed by local wirelength-driven spreading can pr...
Natarajan Viswanathan, Gi-Joon Nam, Charles J. Alp...
CRYPTO
2003
Springer
156views Cryptology» more  CRYPTO 2003»
15 years 11 months ago
Fast Algebraic Attacks on Stream Ciphers with Linear Feedback
Many popular stream ciphers apply a filter/combiner to the state of one or several LFSRs. Algebraic attacks on such ciphers [10, 11] are possible, if there is a multivariate relat...
Nicolas Courtois
ALGORITHMICA
2002
120views more  ALGORITHMICA 2002»
15 years 6 months ago
An Experimental Study of Algorithms for Weighted Completion Time Scheduling
We consider the total weighted completion time scheduling problem for parallel identical machines and precedence constraints, P jprecj PwiCi. This important and broad class of pro...
Ivan D. Baev, Waleed Meleis, Alexandre E. Eichenbe...
SIAMCOMP
2008
95views more  SIAMCOMP 2008»
15 years 6 months ago
On the Algorithmic Aspects of Discrete and Lexicographic Helly-Type Theorems and the Discrete LP-Type Model
Helly's theorem says that, if every d+1 elements of a given finite set of convex objects in Rd have a common point, there is a point common to all of the objects in the set. I...
Nir Halman