1550 search results - page 86 / 310 » Benchmarking for Graph Transformation |
111
click to vote
ICIP
2001
IEEE
16 years 4 months ago
2001
IEEE
This paper presents an efficient method for the estimation and recovering from nonlinear or local geometrical distortions, such as the random bending attack and restricted project...
119
click to vote
PAA
2008
15 years 3 months ago
2008
This paper proposes a method of finding a discriminative linear transformation that enhances the data's degree of conformance to the compactness hypothesis and its inverse. Th...
120
click to vote
EVOW
2005
Springer
15 years 8 months ago
2005
Springer
In this paper, we combine a powerful representation for graph colouring problems with different heuristic strategies for colour assignment. Our novel strategies employ heuristics ...
148
click to vote
ANOR
2002
15 years 3 months ago
2002
We present a Tabu Search (TS) method that employs a simple version of ejection chains for coloring graphs. The procedure is tested on a set of benchmark problems. Empirical result...
111
Voted
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— In this paper, we address the problem of creating an objective benchmark for comparing SLAM approaches. We propose a framework for analyzing the results of SLAM approaches base...