Sciweavers

33 search results - page 4 / 7
» Unbiased Branches: An Open Problem
Sort
View
TCC
2009
Springer
146views Cryptology» more  TCC 2009»
14 years 9 months ago
An Optimally Fair Coin Toss
We address one of the foundational problems in cryptography: the bias of coin-flipping protocols. Coin-flipping protocols allow mutually distrustful parties to generate a common u...
Tal Moran, Moni Naor, Gil Segev
STOC
2005
ACM
147views Algorithms» more  STOC 2005»
14 years 9 months ago
Simulating independence: new constructions of condensers, ramsey graphs, dispersers, and extractors
We present new explicit constructions of deterministic randomness extractors, dispersers and related objects. We say that a distribution X on binary strings of length n is a -sour...
Boaz Barak, Guy Kindler, Ronen Shaltiel, Benny Sud...
ISSTA
2010
ACM
13 years 10 months ago
OCAT: object capture-based automated testing
Testing object-oriented (OO) software is critical because OO languages are commonly used in developing modern software systems. In testing OO software, one important and yet chall...
Hojun Jaygarl, Sunghun Kim, Tao Xie, Carl K. Chang
BMCBI
2010
95views more  BMCBI 2010»
13 years 8 months ago
EPSVR and EPMeta: prediction of antigenic epitopes using support vector regression and multiple server results
Background: Accurate prediction of antigenic epitopes is important for immunologic research and medical applications, but it is still an open problem in bioinformatics. The case f...
Shide Liang, Dandan Zheng, Daron M. Standley, Bo Y...
ESOP
2001
Springer
14 years 1 months ago
On the Complexity of Constant Propagation
Constant propagation (CP) is one of the most widely used optimizations in practice (cf. [9]). Intuitively, it addresses the problem of statically detecting whether an expression al...
Markus Müller-Olm, Oliver Rüthing