Sciweavers

5448 search results - page 676 / 1090
» Breakpoints and Time in Distributed Computations
Sort
View
ICASSP
2010
IEEE
15 years 7 months ago
Improved Internet traffic analysis via optimized sampling
Applications to evaluate Internet quality-of-service and increase network security are essential to maintaining reliability and high performance in computer networks. These applic...
Sean McPherson, Antonio Ortega
DC
2010
15 years 7 months ago
An optimal maximal independent set algorithm for bounded-independence graphs
We present a novel distributed algorithm for the maximal independent set (MIS) problem.1 On bounded-independence graphs (BIG) our deterministic algorithm finishes in O(log n) time,...
Johannes Schneider, Roger Wattenhofer
CN
2007
90views more  CN 2007»
15 years 7 months ago
SweetBait: Zero-hour worm detection and containment using low- and high-interaction honeypots
As next-generation computer worms may spread within minutes to millions of hosts, protection via human intervention is no longer an option. We discuss the implementation of SweetB...
Georgios Portokalidis, Herbert Bos
ISI
2006
Springer
15 years 7 months ago
Collective Sampling and Analysis of High Order Tensors for Chatroom Communications
This work investigates the accuracy and efficiency tradeoffs between centralized and collective (distributed) algorithms for (i) sampling, and (ii) n-way data analysis techniques i...
Evrim Acar, Seyit Ahmet Çamtepe, Bülen...
DAC
2008
ACM
16 years 8 months ago
Model checking based analysis of end-to-end latency in embedded, real-time systems with clock drifts
End-to-end latency of messages is an important design parameter that needs to be within specified bounds for the correct functioning of distributed real-time control systems. In t...
Swarup Mohalik, A. C. Rajeev, Manoj G. Dixit, S. R...