Sciweavers

29908 search results - page 5747 / 5982
» On the Complexity of
Sort
View
COMCOM
2006
194views more  COMCOM 2006»
13 years 9 months ago
INSENS: Intrusion-tolerant routing for wireless sensor networks
This paper describes an INtrusion-tolerant routing protocol for wireless SEnsor NetworkS (INSENS). INSENS securely and efficiently constructs tree-structured routing for wireless ...
Jing Deng, Richard Han, Shivakant Mishra
COMCOM
2006
88views more  COMCOM 2006»
13 years 9 months ago
Using attack graphs for correlating, hypothesizing, and predicting intrusion alerts
To defend against multi-step intrusions in high-speed networks, efficient algorithms are needed to correlate isolated alerts into attack scenarios. Existing correlation methods us...
Lingyu Wang, Anyi Liu, Sushil Jajodia
COMCOM
2006
105views more  COMCOM 2006»
13 years 9 months ago
An observation-based approach towards self-managing web servers
As more business applications have become web enabled, the web server architecture has evolved to provide performance isolation, service differentiation, and QoS guarantees. Vario...
Abhishek Chandra, Prashant Pradhan, Renu Tewari, S...
COMCOM
2006
147views more  COMCOM 2006»
13 years 9 months ago
Coverage-adaptive random sensor scheduling for application-aware data gathering in wireless sensor networks
Due to the application-specific nature of wireless sensor networks, application-aware algorithm and protocol design paradigms are highly required in order to optimize the overall ...
Wook Choi, Sajal K. Das
COMGEO
2006
ACM
13 years 9 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
« Prev « First page 5747 / 5982 Last » Next »