Sciweavers

363 search results - page 35 / 73
» Code Generation for Polynomial Multiplication
Sort
View
ACSAC
2008
IEEE
14 years 2 months ago
Execution Trace-Driven Automated Attack Signature Generation
In its most general form, an attack signature is a program that can correctly determine if an input network packet sequence can successfully attack a protected network application...
Susanta Nanda, Tzi-cker Chiueh
EUROPAR
2006
Springer
13 years 11 months ago
Multi-dimensional Kernel Generation for Loop Nest Software Pipelining
Single-dimension Software Pipelining (SSP) has been proposed as an effective software pipelining technique for multi-dimensional loops [16]. This paper introduces for the first tim...
Alban Douillet, Hongbo Rong, Guang R. Gao
DSN
2006
IEEE
13 years 11 months ago
Efficient High Hamming Distance CRCs for Embedded Networks
Cyclic redundancy codes (CRCs) are widely used in network transmission and data storage applications because they provide better error detection than lighter weight checksum techn...
Justin Ray, Philip Koopman
COMBINATORICS
1999
90views more  COMBINATORICS 1999»
13 years 7 months ago
On the Theory of Pfaffian Orientations. II. T-joins, k-cuts, and Duality of Enumeration
This is a continuation of our paper "A Theory of Pfaffian Orientations I: Perfect Matchings and Permanents". We present a new combinatorial way to compute the generating...
Anna Galluccio, Martin Loebl
ASPDAC
2007
ACM
121views Hardware» more  ASPDAC 2007»
13 years 11 months ago
Approximation Algorithm for Process Mapping on Network Processor Architectures
The high performance requirements of networking applications has led to the advent of programmable network processor (NP) architectures that incorporate symmetric multiprocessing, ...
Christopher Ostler, Karam S. Chatha, Goran Konjevo...