Sciweavers

440 search results - page 30 / 88
» Robustness and modular structure in networks
Sort
View
ICML
2008
IEEE
15 years 10 months ago
Laplace maximum margin Markov networks
We propose Laplace max-margin Markov networks (LapM3 N), and a general class of Bayesian M3 N (BM3 N) of which the LapM3 N is a special case with sparse structural bias, for robus...
Jun Zhu, Eric P. Xing, Bo Zhang
PODC
1990
ACM
15 years 1 months ago
Sharing Memory Robustly in Message-Passing Systems
Emulators that translate algorithms from the shared-memory model to two different message-passing models are presented. Both are achieved by implementing a wait-free, atomic, singl...
Hagit Attiya, Amotz Bar-Noy, Danny Dolev
WWW
2005
ACM
15 years 10 months ago
WAND: a meta-data maintenance system over the internet
WAND is a meta-data management system that provides a file-system tree for users of an internet based P2P network. The tree is robust and retains its structure even when nodes (pe...
Anubhav Bhatia, Saikat Mukherjee, Saugat Mitra, Sr...
INFOCOM
2012
IEEE
13 years 4 days ago
Cuckoo sampling: Robust collection of flow aggregates under a fixed memory budget
—Collecting per-flow aggregates in high-speed links is challenging and usually requires traffic sampling to handle peak rates and extreme traffic mixes. Static selection of sa...
Josep Sanjuàs-Cuxart, Pere Barlet-Ros, Nick...
OPODIS
2007
14 years 11 months ago
Self-stabilizing and Byzantine-Tolerant Overlay Network
Network overlays have been the subject of intensive research in recent years. The paper presents an overlay structure, S-Fireflies, that is self-stabilizing and is robust against ...
Danny Dolev, Ezra N. Hoch, Robbert van Renesse