3247 search results - page 176 / 650 » Randomized smoothing networks |
148
click to vote
STACS
2007
Springer
15 years 10 months ago
2007
Springer
One frequently studied problem in the context of information dissemination in communication networks is the broadcasting problem. In this paper, we study the following randomized b...
133
click to vote
INFOCOM
2009
IEEE
15 years 11 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...
153
click to vote
TVCG
2012
13 years 6 months ago
2012
—In this paper, we study the sensitivity of centrality metrics as a key metric of social networks to support visual reasoning. As centrality represents the prestige or importance...
133
click to vote
CDC
2008
IEEE
15 years 11 months ago
2008
IEEE
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
161
click to vote
NIPS
2007
15 years 5 months ago
2007
In this paper we model relational random variables on the edges of a network using Gaussian processes (GPs). We describe appropriate GP priors, i.e., covariance functions, for dir...