4171 search results - page 354 / 835 » Choice numbers of graphs |
213
click to vote
SLS
2007
Springer
16 years 1 months 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...
210
click to vote
ISMAR
2006
IEEE
16 years 29 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...
213
click to vote
SIBGRAPI
2006
IEEE
16 years 28 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 ...
173
click to vote
ISAAC
2005
Springer
16 years 13 days 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...
216
click to vote
LPNMR
2005
Springer
16 years 13 days ago
2005
Springer
Loops and the corresponding loop formulas play an important role in answer set programming. On the one hand, they are used for guaranteeing correctness and completeness in SAT-base...