Sciweavers

628 search results - page 29 / 126
» Magic Counting Methods
Sort
View
NETGAMES
2006
ACM
14 years 1 months ago
Post-game estimation of game client RTT and hop count distributions
In first person shooter (FPS) games the round trip time (RTT) (delay, or ‘lag’) between a client and server is an important criterion for players when deciding which server to ...
Grenville J. Armitage, Carl Javier, Sebastian Zand...
ASIAN
2004
Springer
180views Algorithms» more  ASIAN 2004»
14 years 1 months ago
Counting by Coin Tossings
Abstract. This text is an informal review of several randomized algorithms that have appeared over the past two decades and have proved instrumental in extracting efficiently quant...
Philippe Flajolet
BMCBI
2010
136views more  BMCBI 2010»
13 years 8 months ago
Bias correction and Bayesian analysis of aggregate counts in SAGE libraries
Background: Tag-based techniques, such as SAGE, are commonly used to sample the mRNA pool of an organism's transcriptome. Incomplete digestion during the tag formation proces...
Russell L. Zaretzki, Michael A. Gilchrist, William...
DIALM
2007
ACM
178views Algorithms» more  DIALM 2007»
13 years 12 months ago
Near-Optimal Compression of Probabilistic Counting Sketches for Networking Applications
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
Björn Scheuermann, Martin Mauve
CORR
2010
Springer
158views Education» more  CORR 2010»
13 years 4 months ago
Counting in Graph Covers: A Combinatorial Characterization of the Bethe Entropy Function
We present a combinatorial characterization of the Bethe entropy function of a factor graph, such a characterization being in contrast to the original, analytical, definition of th...
Pascal O. Vontobel