Sciweavers

92 search results - page 10 / 19
» Finite Element Characteristic Methods Requiring no Quadratur...
Sort
View
FDTC
2006
Springer
80views Cryptology» more  FDTC 2006»
13 years 11 months ago
Robust Finite Field Arithmetic for Fault-Tolerant Public-Key Cryptography
We present a new approach to fault tolerant public key cryptography based on redundant arithmetic in finite rings. Redundancy is achieved by embedding non-redundant field or ring ...
Gunnar Gaubatz, Berk Sunar
IMR
2003
Springer
14 years 27 days ago
Meshing Complexity of Single Part CAD Models
This paper proposes a method for predicting the complexity of meshing Computer Aided Design (CAD) geometries with unstructured, hexahedral, finite elements. Meshing complexity ref...
David R. White, Sunil Saigal, Steven J. Owen
DAC
2008
ACM
14 years 8 months ago
Design of high performance pattern matching engine through compact deterministic finite automata
Pattern matching relies on deterministic finite automata (DFA) to search for predefined patterns. While a bit-DFA method is recently proposed to exploit the parallelism in pattern...
Piti Piyachon, Yan Luo
MOC
2010
13 years 2 months ago
Sharply local pointwise a posteriori error estimates for parabolic problems
Abstract. We prove pointwise a posteriori error estimates for semi- and fullydiscrete finite element methods for approximating the solution u to a parabolic model problem. Our esti...
Alan Demlow, Charalambos Makridakis
MEMOCODE
2010
IEEE
13 years 5 months ago
A regular expression matching using non-deterministic finite automaton
Abstract--This paper shows an implementation of CANSCID (Combined Architecture for Stream Categorization and Intrusion Detection). To satisfy the required system throughput, the pa...
Hiroshi Nakahara, Tsutomu Sasao, Munehiro Matsuura