Sciweavers

205 search results - page 35 / 41
» Complexity of Polynomial Multiplication over Finite Fields
Sort
View
JSAC
2006
172views more  JSAC 2006»
13 years 8 months ago
A Memory-Efficient Parallel String Matching Architecture for High-Speed Intrusion Detection
The ability to inspect both packet headers and payloads to identify attack signatures makes network intrusion detection system (NIDS) a promising approach to protect Internet syste...
Hongbin Lu, Kai Zheng, Bin Liu, Xin Zhang, Y. Liu
ISSAC
2007
Springer
142views Mathematics» more  ISSAC 2007»
14 years 2 months ago
Fast arithmetic for triangular sets: from theory to practice
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
Xin Li, Marc Moreno Maza, Éric Schost
FUIN
2006
81views more  FUIN 2006»
13 years 8 months ago
Redundant Call Elimination via Tupling
Redundant call elimination has been an important program optimisation process as it can produce super-linear speedup in optimised programs. In this paper, we investigate use of the...
Wei-Ngan Chin, Siau-Cheng Khoo, Neil Jones
SC
2009
ACM
14 years 3 months ago
FPGA-based acceleration of CHARMM-potential minimization
Energy minimization is an important step in molecular modeling, with applications in molecular docking and in mapping binding sites. Minimization involves repeated evaluation of v...
Bharat Sukhwani, Martin C. Herbordt
JCT
2007
133views more  JCT 2007»
13 years 8 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky