3204 search results - page 198 / 641 » The Alcuin Number of a Graph |
144
click to vote
GD
2007
Springer
16 years 6 days ago
2007
Springer
In John Tantalo’s on-line game Planarity the player is given a non-plane straight-line drawing of a planar graph. The aim is to make the drawing plane as quickly as possible by m...
186
click to vote
SLS
2007
Springer
16 years 4 days ago
2007
Springer
Abstract. This work presents an algorithm for the sub-graph isomorphism problem based on a new pruning technique for directed graphs. During the tree search, the method checks if a...
180
click to vote
ISMAR
2006
IEEE
16 years 2 days ago
2006
IEEE
With tracking setups becoming increasingly complex, it gets more difficult to find suitable algorithms for tracking, calibration and sensor fusion. A large number of solutions e...
198
click to vote
SIBGRAPI
2006
IEEE
16 years 1 days ago
2006
IEEE
In this paper, we present a novel method for estimating the effective number of independent variables in imaging applications that require multiple hypothesis testing. The method ...
160
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper we present space-query trade-offs for external memory data structures that answer shortest path queries on planar directed graphs. For any S = Ω(N1+ ) and S = O(N2...