2079 search results - page 202 / 416 » Universality of random graphs |
163
click to vote
INFOCOM
2009
IEEE
16 years 1 months ago
2009
IEEE
—A novel counter architecture, called Counter Braids, has recently been proposed for accurate per-flow measurement on high-speed links. Inspired by sparse random graph codes, Co...
248
click to vote
CSR
2011
Springer
14 years 10 months ago
2011
Springer
The Goldreich’s function has n binary inputs and n binary outputs. Every output depends on d inputs and is computed from them by the fixed predicate of arity d. Every Goldreich...
189
click to vote
KDD
2009
ACM
16 years 7 months ago
2009
ACM
Learning probabilistic graphical models from high-dimensional datasets is a computationally challenging task. In many interesting applications, the domain dimensionality is such a...
173
click to vote
SODA
2007
ACM
15 years 8 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
287
click to vote
TOMACS
2011
15 years 1 months ago
2011
We consider the problem of the exact simulation of random variables Z that satisfy the distributional identity Z L = V Y + (1 − V )Z, where V ∈ [0, 1] and Y are independent, an...