5606 search results - page 609 / 1122 » Randomization Techniques for Graphs. |
192
Voted
CAIP
2005
Springer
16 years 18 days ago
2005
Springer
This paper presents a technique for texture segmentation in images. Providing a small template of a texture of interest results in the image being segmented into regions with simil...
177
click to vote
CP
2005
Springer
16 years 18 days ago
2005
Springer
Many problems of theoretical and practical interest can be formulated as Constraint Satisfaction Problems (CSPs). The general CSP is known to be NP-complete; however, distributed m...
177
click to vote
EUROGP
2005
Springer
16 years 17 days ago
2005
Springer
Abstract. Cartesian Genetic Programming is a graph based representation that has many benefits over traditional tree based methods, including bloat free evolution and faster evolu...
183
click to vote
ACIVS
2005
Springer
16 years 16 days ago
2005
Springer
Abstract. In this work we introduce a new technique for a frequently encountered problem in computer vision: image registration. The registration is computed by matching features, ...
204
click to vote
CP
2003
Springer
16 years 8 days ago
2003
Springer
This paper aims to show that Constraint Programming can be an efficient technique to solve a well-known combinatorial optimization problem: the search for a maximum clique in a gra...