3247 search results - page 105 / 650 » Randomized smoothing networks |
126
Voted
SIGECOM
2006
ACM
15 years 10 months ago
2006
ACM
Braess’s Paradox is the counterintuitive but well-known fact that removing edges from a network with “selfish routing” can decrease the latency incurred by traffic in an eq...
161
click to vote
INFOCOM
2012
IEEE
13 years 6 months ago
2012
IEEE
Abstract—Despite recent efforts to characterize complex networks such as citation graphs or online social networks (OSNs), little attention has been given to developing tools tha...
131
Voted
ICDM
2008
IEEE
15 years 10 months ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
141
click to vote
JMLR
2010
14 years 10 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...
120
click to vote
NDSS
2009
IEEE
15 years 10 months ago
2009
IEEE
We describe CSAR, a novel technique for generating cryptographically strong, accountable randomness. Using CSAR, we can generate a pseudo-random sequence and a proof that the elem...