Finite automata determinization is a critical operation for numerous practical applications such as regular expression search. Algorithms have to deal with the possible blow up of ...
Jean-Marc Champarnaud, Fabien Coulon, Thomas Paran...
Despite practical successes with the Futamura projections, it has been an open question whether target programs produced by specializing interpreters can always be as efficient as ...
Reconfigurable computing (RC) is rapidly becoming a vital technology for many applications, from high-performance computing to embedded systems. The inherent advantages of custom-...
Gongyu Wang, Greg Stitt, Herman Lam, Alan D. Georg...
We present a fast proximity query algorithm for haptic display of complex deformable models using a layered representation. Assuming that each solid model can be represented as a ...
Nico Galoppo, Miguel A. Otaduy, Paul Mecklenburg, ...
The state of the practice in object-oriented software development has moved beyond reuse of code to reuse of conceptual structures such as design patterns. This paper draws attenti...