Sciweavers

3415 search results - page 391 / 683
» Lower bounds on kernelization
Sort
View
CN
2007
90views more  CN 2007»
15 years 6 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
CORR
2007
Springer
156views Education» more  CORR 2007»
15 years 6 months ago
Analysis of a Mixed Strategy for Multiple Relay Networks
Abstract— Infrastructure based wireless communications systems as well as ad hoc networks experience a growing importance in present-day telecommunications. An increased density ...
Peter Rost, Gerhard Fettweis
CORR
2010
Springer
162views Education» more  CORR 2010»
15 years 5 months ago
Networked Computing in Wireless Sensor Networks for Structural Health Monitoring
Abstract—This paper studies the problem of distributed computation over a network of wireless sensors. While this problem applies to many emerging applications, to keep our discu...
Apoorva Jindal, Mingyan Liu
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 5 months ago
On Outage and Error Rate Analysis of the Ordered V-BLAST
Outage and error rate performance of the ordered BLAST with more than 2 transmit antennas is evaluated for i.i.d. Rayleigh fading channels. A number of lower and upper bounds on th...
Sergey Loyka, François Gagnon
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
15 years 5 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals