Sciweavers

590 search results - page 73 / 118
» Resolution-stationary random number generators
Sort
View
TCS
2008
15 years 4 months ago
Generalized approximate counting revisited
A large class of q-distributions is defined on the stochastic model of Bernoulli trials in which the probability of success (=advancing to the next level) depends geometrically on...
Guy Louchard, Helmut Prodinger
WADS
1989
Springer
84views Algorithms» more  WADS 1989»
15 years 8 months ago
Skip Lists: A Probabilistic Alternative to Balanced Trees
rees can be used for representing abstract data types such as dictionaries and ordered lists. They work well when the elements are inserted in a random order. Some sequences of ope...
William Pugh
EMSOFT
2008
Springer
15 years 6 months ago
Volatiles are miscompiled, and what to do about it
C's volatile qualifier is intended to provide a reliable link between operations at the source-code level and operations at the memorysystem level. We tested thirteen product...
Eric Eide, John Regehr
MM
2005
ACM
153views Multimedia» more  MM 2005»
15 years 10 months ago
Body degree zero
alization is a combination of abstract generated forms and found imagery. The frequency, amplitude, and percentage differences between samples of incoming data are mapped to forms ...
Alan Dunning, Paul Woodrow, Morley Hollenberg
GLOBECOM
2006
IEEE
15 years 10 months ago
Dynamic Search Algorithm in Unstructured Peer-to-Peer Networks
Flooding and random walk (RW) are the two typical search algorithms in unstructured peer-to-peer networks. The flooding algorithm searches the network aggressively. It covers the m...
Po-Chiang Lin, Tsungnan Lin, Hsinping Wang