Sciweavers

35 search results - page 6 / 7
» Pseudorandomness for Approximate Counting and Sampling
Sort
View
PROMISE
2010
14 years 4 months ago
Exploiting count spectra for Bayesian fault localization
Background: Automated diagnosis of software defects can drastically increase debugging efficiency, improving reliability and time-to-market. Current, low-cost, automatic fault dia...
Rui Abreu, Alberto González-Sanchez, Arjan ...
75
Voted
CORR
2010
Springer
65views Education» more  CORR 2010»
14 years 9 months ago
Fishing in Poisson streams: focusing on the whales, ignoring the minnows
This paper describes a low-complexity approach for reconstructing average packet arrival rates and instantaneous packet counts at a router in a communication network, where the arr...
Maxim Raginsky, Sina Jafarpour, Rebecca Willett, A...
IMC
2009
ACM
15 years 4 months ago
Sampling biases in network path measurements and what to do about it
We show that currently prevalent practices for network path measurements can produce inaccurate inferences because of sampling biases. The inferred mean path latency can be more t...
Srikanth Kandula, Ratul Mahajan
ALGORITHMICA
2008
82views more  ALGORITHMICA 2008»
14 years 9 months ago
Random Bichromatic Matchings
Given a graph with edges colored Red and Blue, we wish to sample and approximately count the number of perfect matchings with exactly k Red edges. We study a Markov chain on the sp...
Nayantara Bhatnagar, Dana Randall, Vijay V. Vazira...
BMCBI
2006
151views more  BMCBI 2006»
14 years 9 months ago
Modeling Sage data with a truncated gamma-Poisson model
Background: Serial Analysis of Gene Expressions (SAGE) produces gene expression measurements on a discrete scale, due to the finite number of molecules in the sample. This means t...
Helene H. Thygesen, Aeilko H. Zwinderman