Sciweavers

909 search results - page 85 / 182
» On the approximability of some network design problems
Sort
View
CCS
2006
ACM
15 years 10 months ago
Evading network anomaly detection systems: formal reasoning and practical techniques
Attackers often try to evade an intrusion detection system (IDS) when launching their attacks. There have been several published studies in evasion attacks, some with available to...
Prahlad Fogla, Wenke Lee
DSN
2007
IEEE
16 years 17 days ago
On the Cost of Modularity in Atomic Broadcast
Modularity is a desirable property of complex software systems, since it simplifies code reuse, verification, maintenance, etc. However, the use of loosely coupled modules intro...
Olivier Rütti, Sergio Mena, Richard Ekwall, A...
IWCMC
2006
ACM
16 years 6 days ago
Modeling key agreement in multi-hop ad hoc networks
Securing multicast communications in ad hoc networks has become one of the most challenging research directions in the areas of wireless networking and security. This is especiall...
Giovanni Di Crescenzo, Maria Striki, John S. Baras
ICRA
2009
IEEE
134views Robotics» more  ICRA 2009»
16 years 27 days ago
Combining search and action for mobile robots
— We explore the interconnection between search and action in the context of mobile robotics. The task of searching for an object and then performing some action with that object...
Geoffrey Hollinger, Dave Ferguson, Siddhartha Srin...
AAIM
2005
Springer
122views Algorithms» more  AAIM 2005»
15 years 11 months ago
Complexity of Minimal Tree Routing and Coloring
Let G be a undirected connected graph. Given a set of g groups each being a subset of V (G), tree routing and coloring is to produce g trees in G and assign a color to each of them...
Xujin Chen, Xiao-Dong Hu, Xiaohua Jia