Sciweavers

1170 search results - page 60 / 234
» How Fast Is Too Fast
Sort
View
INFOCOM
2006
IEEE
15 years 9 months ago
Design and Evaluation of a Fast and Robust Worm Detection Algorithm
— Fast spreading worms are a reality, as amply demonstrated by worms such as Slammer, which reached its peak propagation in a matter of minutes. With these kinds of fast spreadin...
Tian Bu, Aiyou Chen, Scott A. Vander Wiel, Thomas ...
DCC
2010
IEEE
15 years 6 months ago
A Fast Compact Prefix Encoding for Pattern Matching in Limited Resources Devices
This paper improves the Tagged Suboptimal Codes (TSC) compression scheme in several ways. We show how to process the TSC as a universal code. We introduce the TSCk as a family of ...
S. Harrusi, Amir Averbuch, N. Rabin
COGSCI
2010
64views more  COGSCI 2010»
15 years 3 months ago
A One-to-One Bias and Fast Mapping Support Preschoolers' Learning About Faces and Voices
A multi-modal person representation contains information about what a person looks like and what a person sounds like. However, little is known about how children form these face-...
Mariko Moher, Lisa Feigenson, Justin Halberda
IEEEPACT
2009
IEEE
15 years 17 days ago
FASTM: A Log-based Hardware Transactional Memory with Fast Abort Recovery
Abstract--Version management, one of the key design dimensions of Hardware Transactional Memory (HTM) systems, defines where and how transactional modifications are stored. Current...
Marc Lupon, Grigorios Magklis, Antonio Gonzá...
ICCD
2006
IEEE
117views Hardware» more  ICCD 2006»
15 years 11 months ago
Fast, Performance-Optimized Partial Match Address Compression for Low-Latency On-Chip Address Buses
— The influence of interconnects on processor performance and cost is becoming increasingly pronounced with technology scaling. In this paper, we present a fast compression sche...
Jiangjiang Liu, Krishnan Sundaresan, Nihar R. Maha...