3247 search results - page 134 / 650 » Randomized smoothing networks |
137
click to vote
SIAMMAX
2010
14 years 10 months ago
2010
In this paper, we consider estimating sparse inverse covariance of a Gaussian graphical model whose conditional independence is assumed to be partially known. Similarly as in [5],...
188
click to vote
JMLR
2012
13 years 6 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
156
click to vote
INFOCOM
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Stateless opportunistic forwarding is a simple faulttolerant distributed approach for data delivery and information querying in wireless ad hoc networks, where packets a...
132
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
Estimating characteristics of large graphs via sampling is a vital part of the study of complex networks. Current sampling methods such as (independent) random vertex and random w...
121
click to vote
ICIP
2003
IEEE
16 years 5 months ago
2003
IEEE
Random access is a desirable feature in many video communication systems. Intra pictures have been conventionally used as random access points, but correct picture content can als...