Sciweavers

1291 search results - page 158 / 259
» Intrusion Detection for Distributed Applications
Sort
View
SIGOPSE
1996
ACM
14 years 1 months ago
World wide failures
The one issue that unites almost all approaches to distributed computing is the need to know whether certain components in the system have failed or are otherwise unavailable. Whe...
Werner Vogels
JPDC
2006
134views more  JPDC 2006»
13 years 8 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
MOBISYS
2006
ACM
14 years 8 months ago
ARIADNE: a dynamic indoor signal map construction and localization system
Location determination of mobile users within a building has attracted much attention lately due to its many applications in mobile networking including network intrusion detectio...
Yiming Ji, Saad Biaz, Santosh Pandey, Prathima Agr...
INFOCOM
2009
IEEE
14 years 3 months ago
Packet Classification Algorithms: From Theory to Practice
—During the past decade, the packet classification problem has been widely studied to accelerate network applications such as access control, traffic engineering and intrusion de...
Yaxuan Qi, Lianghong Xu, Baohua Yang, Yibo Xue, Ju...
MMSP
2008
IEEE
184views Multimedia» more  MMSP 2008»
14 years 3 months ago
When multimedia advertising meets the new Internet era
—The advent of media-sharing sites, especially along with the so called Web 2.0 wave, has led to the unprecedented Internet delivery of community-contributed media contents such ...
Xian-Sheng Hua, Tao Mei, Shipeng Li