Sciweavers

530 search results - page 78 / 106
» Universal randomized switching
Sort
View
146
Voted
BIB
2007
59views more  BIB 2007»
15 years 3 months ago
Statistically designing microarrays and microarray experiments to enhance sensitivity and specificity
Gene expression signatures from microarray experiments promise to provide important prognostic tools for predicting disease outcome or response to treatment. A number of microarra...
Jason C. Hsu, Jane Chang, Tao Wang, Eiríkur...
STOC
2003
ACM
124views Algorithms» more  STOC 2003»
16 years 4 months ago
Extractors: optimal up to constant factors
This paper provides the first explicit construction of extractors which are simultaneously optimal up to constant factors in both seed length and output length. More precisely, fo...
Chi-Jen Lu, Omer Reingold, Salil P. Vadhan, Avi Wi...
STOC
2002
ACM
112views Algorithms» more  STOC 2002»
16 years 4 months ago
Wait-free consensus with infinite arrivals
A randomized algorithm is given that solves the wait-free consensus problem for a shared-memory model with infinitely many processes. The algorithm is based on a weak shared coin ...
James Aspnes, Gauri Shah, Jatin Shah
134
Voted
PKC
1999
Springer
115views Cryptology» more  PKC 1999»
15 years 8 months ago
Decision Oracles are Equivalent to Matching Oracles
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
Helena Handschuh, Yiannis Tsiounis, Moti Yung
134
Voted
COMPGEOM
1992
ACM
15 years 7 months ago
A Subexponential Bound for Linear Programming
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
Jirí Matousek, Micha Sharir, Emo Welzl