Sciweavers

2370 search results - page 89 / 474
» The Characterization of Data-Accumulating Algorithms
Sort
View
TIT
2008
122views more  TIT 2008»
14 years 9 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
TCS
1998
14 years 9 months ago
An Improved Zero-One Law for Algorithmically Random Sequences
Results on random oracles typically involve showing that a class {X : P(X)} has Lebesgue measure one, i.e., that some property P(X) holds for “almost every X.” A potentially m...
Steven M. Kautz
STOC
2010
ACM
199views Algorithms» more  STOC 2010»
15 years 2 months ago
Zero-One Frequency Laws
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMS...
Vladimir Braverman and Rafail Ostrovsky
PARELEC
2006
IEEE
15 years 3 months ago
Hierarchical Partitioning for Piecewise Linear Algorithms
processor arrays can be used as accelerators for a plenty of data flow-dominant applications. The explosive growth in research and development of massively parallel processor arr...
Hritam Dutta, Frank Hannig, Jürgen Teich
GECCO
2003
Springer
148views Optimization» more  GECCO 2003»
15 years 3 months ago
Structural and Functional Sequence Test of Dynamic and State-Based Software with Evolutionary Algorithms
Evolutionary Testing (ET) has been shown to be very successful for testing real world applications [10]. The original ET approach focusesonsearching for a high coverage of the test...
André Baresel, Hartmut Pohlheim, Sadegh Sad...