13 An induced matching of a graph G is a matching having no two edges joined by14 an edge. An efficient edge dominating set of G is an induced matching M such that15 every other ed...
Domingos Moreira Cardoso, J. Orestes Cerdeira, Cha...
The literature currently provides two ways to establish
point correspondences between images with moving objects.
On one side, there are energy minimization methods
that yield v...
Thomas Brox (University of California, Berkeley), ...
This paper presents our compilation strategy to produce efficient code for pattern matching in the CDuce compiler, taking into account static information provided by the type syst...
We show how to achieve typed and unambiguous declarative pattern matching on strings using regular expressions extended with a simple recording operator. We give a characterizatio...
In many applications string pattern matching is one of the most intensive tasks in terms of computation time and memory accesses. Network Intrusion Detection Systems and DNA Seque...
Ivano Bonesana, Marco Paolieri, Marco D. Santambro...