189 search results - page 2 / 38 » Graph-Theoretic Solutions to Computational Geometry Problems |
CVPR
2009
IEEE
15 years 23 days ago
2009
IEEE
This paper presents a new method for computing optimal L1
solutions for vision geometry problems, particularly for those
problems of fixed-dimension and of large-scale. Our strat...
DGCI
2005
Springer
13 years 11 months ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
MFCS
2009
Springer
14 years 5 days ago
2009
Springer
The longest path problem is the problem of finding a path of maximum length in a graph. Polynomial solutions for this problem are known only for small classes of graphs, while it ...
CPAIOR
2009
Springer
14 years 6 days ago
2009
Springer
Many real-world problems require the enumeration of all solutions of combinatorial search problems, even though this is often infeasible in practice. However, not always all parts ...
SAC
2009
ACM
14 years 13 days ago
2009
ACM
The molecular distance geometry problem can be formulated as the problem of finding an immersion in R3 of a given undirected, nonnegatively weighted graph G. In this paper, we di...