Sciweavers

3228 search results - page 518 / 646
» Basics of Compiler Design
Sort
View
FOIKS
2006
Springer
15 years 7 months ago
Equational Constraint Solving Via a Restricted Form of Universal Quantification
Abstract. In this paper, we present a syntactic method for solving firstorder equational constraints over term algebras. The presented method exploits a novel notion of quasi-solve...
Javier Álvez, Paqui Lucio
120
Voted
FPL
2006
Springer
120views Hardware» more  FPL 2006»
15 years 7 months ago
Regular Expression Software Deceleration for Intrusion Detection Systems
The use of reconfigurable hardware for network security applications has recently made great strides as FPGA devices have provided larger and faster resources. Regular expressions...
Zachary K. Baker, Viktor K. Prasanna, Hong-Jip Jun...
EUROCRYPT
2000
Springer
15 years 7 months ago
Authenticated Key Exchange Secure against Dictionary Attacks
Password-based protocols for authenticated key exchange (AKE) are designed to work despite the use of passwords drawn from a space so small that an adversary might well enumerate, ...
Mihir Bellare, David Pointcheval, Phillip Rogaway
130
Voted
GCSE
2000
Springer
15 years 7 months ago
Generic Components: A Symbiosis of Paradigms
Software reuse and especially the paradigm of software components are promising approaches to increase the efficiency of software development. One of the basic problems of software...
Martin Becker
ICRA
2000
IEEE
176views Robotics» more  ICRA 2000»
15 years 7 months ago
RRT-Connect: An Efficient Approach to Single-Query Path Planning
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...
James J. Kuffner Jr., Steven M. LaValle