78 search results - page 6 / 16 » Linear Solvability in the Viewing Graph |
112
Voted
ECCC
2006
15 years 1 months ago
2006
Attempts at classifying computational problems as polynomial time solvable, NP-complete, or belonging to a higher level in the polynomial hierarchy, face the difficulty of undecid...
109
click to vote
ALGORITHMICA
2007
15 years 1 months ago
2007
A tree t-spanner T in a graph G is a spanning tree of G such that the distance between every pair of vertices in T is at most t times their distance in G. The tree t-spanner proble...
119
Voted
CVPR
2006
IEEE
16 years 3 months ago
2006
IEEE
We present a novel discriminative-generative hybrid approach in this paper, with emphasis on application in multiview object detection. Our method includes a novel generative mode...
116
click to vote
COCOA
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study the complexity of several coloring problems on graphs, parameterized by the treewidth t of the graph: (1) The list chromatic number χl(G) of a graph G is defin...
182
Voted
EEE
2005
IEEE
15 years 7 months ago
2005
IEEE
Effective Web site design is critical to the success of e-commerce. Therefore, the evaluation and enhancement of a Web site design is of great importance. In this vein, accessibil...