1525 search results - page 83 / 305 » Matching with Regular Constraints |
159
click to vote
DM
2006
15 years 6 months ago
2006
A graph is called almost self-complementary if it is isomorphic to one of its almost complements Xc - I, where Xc denotes the complement of X and I a perfect matching (1-factor) i...
158
click to vote
PADL
2010
Springer
16 years 3 months ago
2010
Springer
Abstract. We show how testing convertibility of two types in dependently typed systems can advantageously be implemented instead untyped normalization by evaluation, thereby reusin...
298
click to vote
ICIAR
2009
Springer
16 years 28 days ago
2009
Springer
The SIFT (Scale Invariant Feature Transform) descriptor is a widely used method for matching image features. However, perfect scale invariance can not be achieved in practice becau...
200
click to vote
ANCS
2006
ACM
16 years 10 days ago
2006
ACM
Modern deep packet inspection systems use regular expressions to define various patterns of interest in network data streams. Deterministic Finite Automata (DFA) are commonly used...
164
click to vote
ICSM
2003
IEEE
15 years 11 months ago
2003
IEEE
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...