Sciweavers

1525 search results - page 9 / 305
» Matching with Regular Constraints
Sort
View
DAM
2008
147views more  DAM 2008»
13 years 7 months ago
Efficient edge domination in regular graphs
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...
CVPR
2009
IEEE
15 years 2 months ago
Large Displacement Optical Flow
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), ...
IFIP
2004
Springer
14 years 22 days ago
Regular Tree Language Recognition with Static Information
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...
Alain Frisch
PPDP
2010
Springer
13 years 5 months ago
Typed and unambiguous pattern matching on strings using regular expressions
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...
Claus Brabrand, Jakob G. Thomsen
DATE
2008
IEEE
182views Hardware» more  DATE 2008»
14 years 1 months ago
An adaptable FPGA-based System for Regular Expression Matching
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...