1327 search results - page 155 / 266 » Path following algorithm for the graph matching problem |
129
click to vote
IJAC
2007
15 years 3 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
124
click to vote
CGF
2004
15 years 3 months ago
2004
We present a technique for creating a smoothly varying sequence of procedural textures that interpolates between arbitrary input samples of texture. This texture transformation us...
129
click to vote
FPGA
2005
ACM
15 years 9 months ago
2005
ACM
Logic duplication is an effective method for improving circuit performance. In this paper we present an algorithm named SPD that performs simultaneous placement and duplication to...
138
click to vote
IEEEARES
2009
IEEE
15 years 10 months ago
2009
IEEE
Abstract—Attack Graphs are an important support for assessment and subsequent improvement of network security. They reveal possible paths an attacker can take to break through se...
145
click to vote
PLILP
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. We address the problem of term normalisation modulo associativecommutative (AC) theories, and describe several techniques for compiling many-to-one AC matching and reduce...