Sciweavers

334 search results - page 48 / 67
» Inapproximability of Survivable Networks
Sort
View
IPPS
1998
IEEE
14 years 25 days ago
An Architecture for Network Resource Monitoring in a Distributed Environment
As part of its HiPer-D Program, the United States Navy is developing an experimental distributed system which achieves survivability by dynamically reconfiguring the system using ...
Philip M. Irey IV, Robert W. Hott, David T. Marlow
COCOA
2008
Springer
13 years 10 months ago
Strong Formulations for 2-Node-Connected Steiner Network Problems
Abstract. We consider a survivable network design problem known as the 2-NodeConnected Steiner Network Problem (2NCON): we are given a weighted undirected graph with a node partiti...
Markus Chimani, Maria Kandyba, Ivana Ljubic, Petra...
ICASSP
2009
IEEE
14 years 3 months ago
Multi-flow attack resistant watermarks for network flows
In this work we present a Multi-flow Attack Resistant Interval Centroid Based Watermarking (MAR-ICBW) scheme for network flows. Our proposed scheme can withstand the newly intro...
Amir Houmansadr, Negar Kiyavash, Nikita Borisov
ICC
2008
IEEE
137views Communications» more  ICC 2008»
14 years 3 months ago
Reliability of Connections in Multilayer Networks under Shared Risk Groups and Costs Constraints
The notion of Shared Risk Resource Groups (SRRG) has been introduced to capture survivability issues when a set of resources may fail simultaneously. Applied to Wavelength Divisio...
David Coudert, Florian Huc, Fabrice Peix, Marie-Em...
UAI
2000
13 years 10 months ago
Rao-Blackwellised Particle Filtering for Dynamic Bayesian Networks
Particle filters (PFs) are powerful samplingbased inference/learning algorithms for dynamic Bayesian networks (DBNs). They allow us to treat, in a principled way, any type of prob...
Arnaud Doucet, Nando de Freitas, Kevin P. Murphy, ...