3247 search results - page 114 / 650 » Randomized smoothing networks |
130
click to vote
NETWORKS
2008
15 years 3 months ago
2008
The Network Interdiction Problem involves interrupting an adversary's ability to maximize flow through a capacitated network by destroying portions of the network. A budget c...
131
click to vote
HICSS
2006
IEEE
15 years 10 months ago
2006
IEEE
— Uniform sampling in networks is at the core of a wide variety of randomized algorithms. Random sampling can be performed by modeling the system as an undirected graph with asso...
147
Voted
USENIX
2007
15 years 6 months ago
2007
Random peer selection is used by numerous P2P applications; examples include application-level multicast, unstructured file sharing, and network location mapping. In most of thes...
131
Voted
ICDCS
2007
IEEE
15 years 10 months ago
2007
IEEE
Both peer-to-peer and sensor networks have the fundamental characteristics of node churn and failures. Peers in P2P networks are highly dynamic, whereas sensors are not dependable...
152
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...