4926 search results - page 116 / 986 » Two Graph Algorithms On an Associative Computing Model |
133
Voted
WSCG
2003
15 years 3 months ago
2003
In this paper we present a non-interactive method for recoloring a destination image according to the color scheme found in a source image. The approach is motivated by trying to ...
135
click to vote
CONSTRAINTS
2007
15 years 2 months ago
2007
The graph set T-colouring problem (GSTCP) generalises the classical graph colouring problem; it asks for the assignment of sets of integers to the vertices of a graph such that co...
133
click to vote
IJDAR
2006
15 years 2 months ago
2006
Evaluation of object detection algorithms is a non-trivial task: a detection result is usually evaluated by comparing the bounding box of the detected object with the bounding box...
142
click to vote
AAI
2007
15 years 2 months ago
2007
In recent years, the KDD process has been advocated to be an iterative and interactive process. It is seldom the case that a user is able to answer immediately with a single query...
128
click to vote
EVOW
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper presents an application of a hierarchical social (HS) metaheuristic to region-based segmentation. The original image is modelled as a simplified image graph, w...