Sciweavers

1403 search results - page 123 / 281
» About Approximations of Exponentials
Sort
View
PLDI
2004
ACM
15 years 10 months ago
KISS: keep it simple and sequential
The design of concurrent programs is error-prone due to the interaction between concurrently executing threads. Traditional automated techniques for finding errors in concurrent ...
Shaz Qadeer, Dinghao Wu
152
Voted
CG
2004
Springer
15 years 8 months ago
Locally Informed Global Search for Sums of Combinatorial Games
Abstract. There are two complementary approaches to playing sums of combinatorial games. They can be characterized as local analysis and global search. Algorithms from combinatoria...
Martin Müller 0003, Zhichao Li
131
Voted
APPROX
2010
Springer
213views Algorithms» more  APPROX 2010»
15 years 6 months ago
Constructive Proofs of Concentration Bounds
We give a simple combinatorial proof of the Chernoff-Hoeffding concentration bound [Che52, Hoe63], which says that the sum of independent {0, 1}-valued random variables is highly ...
Russell Impagliazzo, Valentine Kabanets
BMCBI
2010
124views more  BMCBI 2010»
15 years 4 months ago
Estimating time since infection in early homogeneous HIV-1 samples using a poisson model
Background: The occurrence of a genetic bottleneck in HIV sexual or mother-to-infant transmission has been well documented. This results in a majority of new infections being homo...
Elena E. Giorgi, Bob Funkhouser, Gayathri Athreya,...
BMCBI
2006
144views more  BMCBI 2006»
15 years 4 months ago
Association algorithm to mine the rules that govern enzyme definition and to classify protein sequences
Background: The number of sequences compiled in many genome projects is growing exponentially, but most of them have not been characterized experimentally. An automatic annotation...
Shih-Hau Chiu, Chien-Chi Chen, Gwo-Fang Yuan, Thy-...