686 search results - page 60 / 138 » On the General Applicability of Instruction-Set Randomizatio... |
190
click to vote
BMCBI
2011
14 years 10 months ago
2011
Background: Molecular database search tools need statistical models to assess the significance for the resulting hits. In the classical approach one asks the question how probable...
161
click to vote
ADHOCNOW
2004
Springer
15 years 8 months ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
104
Voted
FOCS
2009
IEEE
15 years 10 months ago
2009
IEEE
We generalize the Kahn-Kalai-Linial (KKL) Theorem to random walks on Cayley and Schreier graphs, making progress on an open problem of Hoory, Linial, and Wigderson. In our general...
131
Voted
EGH
2003
Springer
15 years 8 months ago
2003
Springer
We show how a future graphics processor unit (GPU), enhanced with random read and write to video memory, can represent, refine and adjust complex meshes arising in modeling, simu...
113
click to vote
WSC
1998
15 years 4 months ago
1998
Bootstrapping is a resampling technique that requires less computer time than simulation does. Bootstrapping -like simulation-must be defined for each type of application. This pa...