Sciweavers

501 search results - page 48 / 101
» Communication Lower Bounds Using Dual Polynomials
Sort
View
FOCS
2004
IEEE
14 years 17 days ago
Extracting Randomness Using Few Independent Sources
In this work we give the first deterministic extractors from a constant number of weak sources whose entropy rate is less than 1/2. Specifically, for every > 0 we give an expl...
Boaz Barak, Russell Impagliazzo, Avi Wigderson
COLT
2008
Springer
13 years 10 months ago
Learning Acyclic Probabilistic Circuits Using Test Paths
We define a model of learning probabilistic acyclic circuits using value injection queries, in which an arbitrary subset of wires is set to fixed values, and the value on the sing...
Dana Angluin, James Aspnes, Jiang Chen, David Eise...
MOBICOM
2006
ACM
14 years 2 months ago
On optimal communication cost for gathering correlated data through wireless sensor networks
In many energy-constrained wireless sensor networks, nodes cooperatively forward correlated sensed data to data sinks. In order to reduce the communication cost (e.g. overall ener...
Junning Liu, Micah Adler, Donald F. Towsley, Chun ...
ECSQARU
1995
Springer
14 years 12 days ago
Parametric Structure of Probabilities in Bayesian Networks
The paper presents a method for uncertainty propagation in Bayesian networks in symbolic, as opposed to numeric, form. The algebraic structure of probabilities is characterized. Th...
Enrique Castillo, José Manuel Gutiér...
INFOCOM
2009
IEEE
14 years 3 months ago
Optimal Fast Hashing
Abstract—This paper is about designing optimal highthroughput hashing schemes that minimize the total number of memory accesses needed to build and access an hash table. Recent s...
Josef Kanizo, David Hay, Isaac Keslassy