Sciweavers

1079 search results - page 17 / 216
» An Implementation of an Address Generator Using Hash Memorie...
Sort
View
KIVS
2005
Springer
15 years 8 months ago
Measuring Large Overlay Networks - The Overnet Example
Peer-to-peer overlay networks have grown significantly in size and sophistication over the last years. Meanwhile, distributed hash tables (DHT) provide efficient means to create g...
Kendy Kutzner, Thomas Fuhrmann
ICPR
2002
IEEE
15 years 8 months ago
Biometric Hash based on Statistical Features of Online Signatures
This paper presents a new approach to generate biometric hash values based on statistical features in online signature signals. Whilst the output of typical online signature verif...
Claus Vielhauer, Ralf Steinmetz, Astrid Mayerh&oum...
ACSAC
2006
IEEE
15 years 9 months ago
Address-Space Randomization for Windows Systems
Address-space randomization (ASR) is a promising solution to defend against memory corruption attacks that have contributed to about three-quarters of USCERT advisories in the pas...
Lixin Li, James E. Just, R. Sekar
ICCAD
2004
IEEE
114views Hardware» more  ICCAD 2004»
16 years 3 days ago
High-level synthesis using computation-unit integrated memories
Abstract— High-level synthesis (HLS) of memory-intensive applications has featured several innovations in terms of enhancements made to the basic memory organization and data lay...
Chao Huang, Srivaths Ravi, Anand Raghunathan, Nira...
CMS
2006
15 years 4 months ago
TAO: Protecting Against Hitlist Worms Using Transparent Address Obfuscation
Abstract. Sophisticated worms that use precomputed hitlists of vulnerable targets are especially hard to contain, since they are harder to detect, and spread at rates where even au...
Spyros Antonatos, Kostas G. Anagnostakis