Sciweavers

14 search results - page 3 / 3
» Pitfalls in computing with pseudorandom determinants
Sort
View
PPOPP
2010
ACM
14 years 7 months ago
Lazy binary-splitting: a run-time adaptive work-stealing scheduler
We present Lazy Binary Splitting (LBS), a user-level scheduler of nested parallelism for shared-memory multiprocessors that builds on existing Eager Binary Splitting work-stealing...
Alexandros Tzannes, George C. Caragea, Rajeev Baru...
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 4 months ago
On the Simulation of Tikhonov Random Processes
Abstract— A novel, simple and efficient method for the generation of Tikhonov (a.k.a. von Mises) random variates is proposed. In the proposed method, circular variates of a pres...
Giuseppe Thadeu Freitas de Abreu
IMC
2005
ACM
14 years 3 months ago
Exploiting Underlying Structure for Detailed Reconstruction of an Internet-scale Event
Network “telescopes” that record packets sent to unused blocks of Internet address space have emerged as an important tool for observing Internet-scale events such as the spre...
Abhishek Kumar, Vern Paxson, Nicholas Weaver
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
14 years 2 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill