882 search results - page 106 / 177 » On the Hardness of Graph Isomorphism |
177
click to vote
EMMCVPR
2007
Springer
16 years 16 days ago
2007
Springer
Classic mosaic is one of the oldest and most durable art forms. There has been a growing interest in simulating classic mosaics from digital images recently. To be visually pleasin...
178
click to vote
PAMI
2007
15 years 5 months ago
2007
—A novel patch-based correspondence model is presented in this paper. Many segment-based correspondence approaches have been proposed in recent years. Untextured pixels and bound...
162
click to vote
ICFP
2001
ACM
16 years 6 months ago
2001
ACM
The type systems of most typed functional programming languages are based on the Hindley-Milner type system. A practical problem with these type systems is that it is often hard t...
172
click to vote
SAC
2000
ACM
15 years 10 months ago
2000
ACM
The coding by which chromosomes represent candidate solutions is a fundamental design choice in a genetic algorithm. This paper describes a novel coding of spanning trees in a gen...
194
click to vote
GECCO
2010
Springer
15 years 10 months ago
2010
Springer
This paper presents a new form of Genetic Programming called Cartesian Genetic Programming in which a program is represented as an indexed graph. The graph is encoded in the form o...