2877 search results - page 422 / 576 » The Complexity of Planarity Testing |
152
click to vote
CONEXT
2007
ACM
15 years 8 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
148
Voted
DAC
2007
ACM
15 years 8 months ago
2007
ACM
While cryptographic algorithms are usually strong against mathematical attacks, their practical implementation, both in software and in hardware, opens the door to side-channel at...
129
click to vote
DAC
2010
ACM
15 years 8 months ago
2010
ACM
State-of-the-art automatic reliability analyses as used in system-level design approaches mainly rely on Binary Decision Diagrams (BDDs) and, thus, face two serious problems: (1) ...
135
Voted
SP
2010
IEEE
15 years 8 months ago
2010
IEEE
The computer systems security arms race between attackers and defenders has largely taken place in the domain of software systems, but as hardware complexity and design processes ...
157
click to vote
ICCAD
2007
IEEE
15 years 8 months ago
2007
IEEE
This paper addresses the design of multi-mode architectures for digital signal processing applications. We present a dedicated design flow and its associated high-level synthesis t...