Sciweavers

230 search results - page 4 / 46
» Testing Closeness of Discrete Distributions
Sort
View
RSP
2007
IEEE
139views Control Systems» more  RSP 2007»
15 years 4 months ago
Verifying Distributed Protocols using MSC-Assertions, Run-time Monitoring, and Automatic Test Generation
This paper addresses the need for formal specification and runtime verification of system-level requirements of distributed reactive systems. It describes a formalism for specifyi...
Doron Drusinsky, Man-tak Shing
ICC
2009
IEEE
144views Communications» more  ICC 2009»
15 years 4 months ago
Capacity of Optical Intensity Channels with Peak and Average Power Constraints
— The design and analysis of capacity-approaching input signalling for optical intensity channels are presented. Both peak and average optical power constraints are considered in...
Ahmed A. Farid, Steve Hranilovic
BMCBI
2005
93views more  BMCBI 2005»
14 years 9 months ago
Computing expectation values for RNA motifs using discrete convolutions
Background: Computational biologists use Expectation values (E-values) to estimate the number of solutions that can be expected by chance during a database scan. Here we focus on ...
André Lambert, Matthieu Legendre, Jean-Fred...
STACS
2010
Springer
15 years 4 months ago
Quantum Algorithms for Testing Properties of Distributions
Abstract. Suppose one has access to oracles generating samples from two unknown probability distributions p and q on some N-element set. How many samples does one need to test whet...
Sergey Bravyi, Aram Wettroth Harrow, Avinatan Hass...
CDC
2009
IEEE
173views Control Systems» more  CDC 2009»
15 years 2 months ago
Sequentially updated Probability Collectives
— Multi-agent coordination problems can be cast as distributed optimization tasks. Probability Collectives (PCs) are techniques that deal with such problems in discrete and conti...
Michalis Smyrnakis, David S. Leslie