Sciweavers

1093 search results - page 207 / 219
» Fast Abstracts
Sort
View
CMS
2006
13 years 9 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
AIPS
2003
13 years 9 months ago
A Multi-Agent System-driven AI Planning Approach to Biological Pathway Discovery
As genomic and proteomic data is collected from highthroughput methods on a daily basis, subcellular components are identified and their in vitro behavior is characterized. Howev...
Salim Khan, William Gillis, Carl Schmidt, Keith De...
WSC
2004
13 years 9 months ago
A Case Study in Meta-Simulation Design and Performance Analysis for Large-Scale Networks
Simulation and Emulation techniques are fundamental to aid the process of large-scale protocol design and network operations. However, the results from these techniques are often ...
David W. Bauer, Garrett R. Yaun, Christopher D. Ca...
SEBD
2003
144views Database» more  SEBD 2003»
13 years 9 months ago
Approximate Query Answering on Sensor Network Data Streams
Abstract. Sensor networks represent a non traditional source of information, as readings generated by sensors flow continuously, leading to an infinite stream of data. Traditiona...
Alfredo Cuzzocrea, Filippo Furfaro, Elio Masciari,...
ICISC
2000
126views Cryptology» more  ICISC 2000»
13 years 9 months ago
Cryptographic Applications of Sparse Polynomials over Finite Rings
Abstract. This paper gives new examples that exploit the idea of using sparse polynomials with restricted coefficients over a finite ring for designing fast, reliable cryptosystems...
William D. Banks, Daniel Lieman, Igor Shparlinski,...