Sciweavers

2304 search results - page 52 / 461
» On the Vulnerability of Large Graphs
Sort
View
DSN
2004
IEEE
15 years 3 months ago
Cluster-Based Failure Detection Service for Large-Scale Ad Hoc Wireless Network Applications
The growing interest in ad hoc wireless network applications that are made of large and dense populations of lightweight system resources calls for scalable approaches to fault to...
Ann T. Tai, Kam S. Tso, William H. Sanders
GLOBECOM
2009
IEEE
15 years 3 months ago
Protecting SIP against Very Large Flooding DoS Attacks
—The use of the Internet for VoIP communications has seen an important increase over the last few years, with the Session Initiation Protocol (SIP) as the most popular protocol u...
Felipe Huici, Saverio Niccolini, Nico d'Heureuse
AUSAI
2008
Springer
15 years 1 months ago
L-Diversity Based Dynamic Update for Large Time-Evolving Microdata
Data anonymization techniques based on enhanced privacy principles have been the focus of intense research in the last few years. All existing methods achieving privacy principles ...
Xiaoxun Sun, Hua Wang, Jiuyong Li
WG
2004
Springer
15 years 5 months ago
Unhooking Circulant Graphs: A Combinatorial Method for Counting Spanning Trees and Other Parameters
It has long been known that the number of spanning trees in circulant graphs with fixed jumps and n nodes satisfies a recurrence relation in n. The proof of this fact was algebra...
Mordecai J. Golin, Yiu-Cho Leung
DIMVA
2010
15 years 1 months ago
Organizing Large Scale Hacking Competitions
Computer security competitions and challenges are a way to foster innovation and educate students in a highly-motivating setting. In recent years, a number of different security co...
Nicholas Childers, Bryce Boe, Lorenzo Cavallaro, L...