Sciweavers

866 search results - page 93 / 174
» Bidirectionalizing graph transformations
Sort
View
WCC
2005
Springer
156views Cryptology» more  WCC 2005»
15 years 3 months ago
One and Two-Variable Interlace Polynomials: A Spectral Interpretation
We relate the one- and two-variable interlace polynomials of a graph to the spectra of a quadratic boolean function with respect to a strategic subset of local unitary transforms. ...
Constanza Riera, Matthew G. Parker
AVBPA
2003
Springer
106views Biometrics» more  AVBPA 2003»
15 years 3 months ago
A Face Recognition System Based on Local Feature Analysis
In this paper a completely automatic face recognition system is presented. The system is inspired by the elastic bunch graph method, but the fiducial point localization is complet...
Stefano Arca, Paola Campadelli, Raffaella Lanzarot...
COMBINATORICS
2006
112views more  COMBINATORICS 2006»
14 years 10 months ago
More Forbidden Minors for Wye-Delta-Wye Reducibility
A graph is Y Y reducible if it can be reduced to isolated vertices by a sequence of series-parallel reductions and Y Y transformations. It is still an open problem to characterize...
Yaming Yu
JSAT
2006
87views more  JSAT 2006»
14 years 9 months ago
Hard Satisfiable Clause Sets for Benchmarking Equivalence Reasoning Techniques
A family of satisfiable benchmark instances in conjunctive normal form is introduced. The instances are constructed by transforming a random regular graph into a system of linear ...
Harri Haanpää, Matti Järvisalo, Pet...
FASE
2009
Springer
15 years 1 months ago
Object Flow Definition for Refined Activity Diagrams
Activity diagrams are a well-known means to model the control flow of system behavior. Their expressiveness can be enhanced by using their object flow notation. In addition, we ref...
Stefan Jurack, Leen Lambers, Katharina Mehner, Gab...