3204 search results - page 274 / 641 » The b-chromatic Number of a Graph |
113
Voted
ISMAR
2006
IEEE
15 years 6 months 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...
135
Voted
SIBGRAPI
2006
IEEE
15 years 6 months 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 ...
110
click to vote
ISAAC
2005
Springer
15 years 6 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...
128
Voted
LPNMR
2005
Springer
15 years 6 months 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...
112
Voted
MFCS
2005
Springer
15 years 6 months ago
2005
Springer
Due to extensive research on tree-width for undirected graphs and due to its many applications in various fields it has been a natural desire for many years to generalize the idea...