Sciweavers

1132 search results - page 102 / 227
» Upper and lower Ramsey bounds in bounded arithmetic
Sort
View
VTS
2006
IEEE
98views Hardware» more  VTS 2006»
16 years 12 days ago
Iterative OPDD Based Signal Probability Calculation
This paper presents an improved method to accurately estimate signal probabilities using ordered partial decision diagrams (OPDDs) [Kodavarti 93] for partial representation of the...
Avijit Dutta, Nur A. Touba
SIGECOM
2005
ACM
105views ECommerce» more  SIGECOM 2005»
15 years 12 months ago
Communication complexity of common voting rules
We determine the communication complexity of the common voting rules. The rules (sorted by their communication complexity from low to high) are plurality, plurality with runoff, ...
Vincent Conitzer, Tuomas Sandholm
UAI
1998
15 years 7 months ago
Large Deviation Methods for Approximate Probabilistic Inference
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
Michael J. Kearns, Lawrence K. Saul
ICASSP
2010
IEEE
15 years 6 months ago
On unbiased estimation of sparse vectors corrupted by Gaussian noise
We consider the estimation of a sparse parameter vector from measurements corrupted by white Gaussian noise. Our focus is on unbiased estimation as a setting under which the difï¬...
Alexander Jung, Zvika Ben-Haim, Franz Hlawatsch, Y...
TIT
2008
102views more  TIT 2008»
15 years 6 months ago
Average Stopping Set Weight Distributions of Redundant Random Ensembles
In this paper, redundant random ensembles are defined and their average stopping set (SS) weight distributions are analyzed. A redundant random ensemble consists of a set of binar...
Tadashi Wadayama