Sciweavers

3247 search results - page 275 / 650
» Randomized smoothing networks
Sort
View
UAI
1998
15 years 7 months ago
Large Deviation Methods for Approximate Probabilistic Inference
We study two-layer belief networks of binary random variables in which the conditional probabilities Pr childjparents depend monotonically on weighted sums of the parents. In larg...
Michael J. Kearns, Lawrence K. Saul
IJNSEC
2008
96views more  IJNSEC 2008»
15 years 6 months ago
On the Effectiveness of Continuous-Time Mixes under Flow-Correlation Based Anonymity Attacks
In flow-based mix networks, flow correlation attacks have been proposed earlier and have been shown empirically to seriously degrade mix-based anonymous communication systems. In ...
Ye Zhu, Xinwen Fu, Riccardo Bettati
JCIT
2008
136views more  JCIT 2008»
15 years 6 months ago
A Packet Partition Scheduling Mechanism for Bandwidth Aggregation over Multiple Paths
This paper proposes a packet partition scheduling mechanism for bandwidth aggregation over end-to-end multi-path through multiple network interfaces. The proposed mechanism effect...
Pyung-Soo Kim, Joo Young Yoon, Hanlim Kim
SIGCOMM
2010
ACM
15 years 4 months ago
Backpressure-based routing protocol for DTNs
In this paper we consider an alternative, highly agile approach called backpressure routing for Delay Tolerant Networks (DTN), in which routing and forwarding decisions are made o...
Amit Dvir, Athanasios V. Vasilakos
INFOCOM
2005
IEEE
15 years 11 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...