Sciweavers

2421 search results - page 135 / 485
» Approximate Flow-Aware Networking
Sort
View
JCO
2010
101views more  JCO 2010»
15 years 1 months ago
Separator-based data reduction for signed graph balancing
Abstract Polynomial-time data reduction is a classical approach to hard graph problems. Typically, particular small subgraphs are replaced by smaller gadgets. We generalize this ap...
Falk Hüffner, Nadja Betzler, Rolf Niedermeier
GLOBECOM
2010
IEEE
15 years 1 months ago
Predicting Critical Intradomain Routing Events
Network equipments generate an overwhelming number of reports and alarms every day, but only a small fraction of these alarms require the intervention of network operators. Our goa...
Amelie Medem Kuatse, Renata Teixeira, Nicolas Usun...
142
Voted
MASS
2010
159views Communications» more  MASS 2010»
14 years 10 months ago
Efficient WiFi deployment algorithms based on realistic mobility characteristics
Abstract--Recent years have witnessed the emergence of numerous new Internet services for mobile users. Supporting mobile applications via public WiFi networks has received signifi...
Tian Wang, Guoliang Xing, Minming Li, Weijia Jia
MOR
2010
115views more  MOR 2010»
14 years 10 months ago
Directional Derivatives of Oblique Reflection Maps
Given an oblique reflection map and functions , Dlim (the space of functions that have left and right limits at every point), the directional derivative () of along , evaluate...
Avi Mandelbaum, Kavita Ramanan
AAAI
2012
13 years 5 months ago
POMDPs Make Better Hackers: Accounting for Uncertainty in Penetration Testing
Penetration Testing is a methodology for assessing network security, by generating and executing possible hacking attacks. Doing so automatically allows for regular and systematic...
Carlos Sarraute, Olivier Buffet, Jörg Hoffman...