10608 search results - page 416 / 2122 » Complexity of O'Hara's Algorithm |
118
click to vote
WEA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper we present a novel approach to the graph isomorphism problem. We combine a direct approach, that tries to find a mapping between the two input graphs using...
185
click to vote
ISPDC
2008
IEEE
15 years 11 months ago
2008
IEEE
This paper presents a new approach for analyzing the performance of grid scheduling algorithms for tasks with dependencies. Finding the optimal procedures for DAG scheduling in Gr...
137
click to vote
IROS
2007
IEEE
15 years 10 months ago
2007
IEEE
— Simple, fast and lightweight SLAM algorithms are necessary in many embedded robotic systems which soon will be used in houses and offices in order to do various service tasks....
140
click to vote
CSCLP
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. The union-find algorithm can be seen as solving simple equations between variables or constants. With a few lines of code change, we generalise its implementation in CHR...
168
click to vote
GECCO
2007
Springer
15 years 10 months ago
2007
Springer
This paper introduces a method for clustering complex and linearly non-separable datasets, without any prior knowledge of the number of naturally occurring clusters. The proposed ...