Sciweavers

2434 search results - page 109 / 487
» Algorithmic Randomness of Closed Sets
Sort
View
STOC
2009
ACM
159views Algorithms» more  STOC 2009»
16 years 4 months ago
Message passing algorithms and improved LP decoding
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
120
Voted
OOPSLA
2010
Springer
15 years 1 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
118
Voted
TCS
1998
15 years 3 months ago
ERCW PRAMs and Optical Communication
This paper presents algorithms and lower bounds for several fundamental problems on the Exclusive Read, Concurrent Write Parallel Random Access Machine (ERCW PRAM) and some result...
Philip D. MacKenzie, Vijaya Ramachandran
168
Voted
AML
2011
177views Mathematics» more  AML 2011»
14 years 10 months ago
A superhigh diamond in the c.e. tt-degrees
The notion of superhigh computably enumerable (c.e.) degrees was first introduced by Mohrherr in [7], where she proved the existence of incomplete superhigh c.e. degrees, and high...
Douglas Cenzer, Johanna N. Y. Franklin, Jiang Liu ...
132
Voted
RECOMB
2008
Springer
16 years 3 months ago
Algorithms for Joint Optimization of Stability and Diversity in Planning Combinatorial Libraries of Chimeric Proteins
Abstract. In engineering protein variants by constructing and screening combinatorial libraries of chimeric proteins, two complementary and competing goals are desired: the new pro...
Wei Zheng, Alan M. Friedman, Chris Bailey-Kellogg