900 search results - page 56 / 180 » On Polynomial Time Computation over Unordered Structures |
CVPR
2009
IEEE
15 years 4 months ago
2009
IEEE
Many vision and graphics problems such as relighting,
structured light scanning and photometric stereo, need im-
ages of a scene under a number of different illumination
conditi...
TCBB
2010
2010
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
13 years 3 months ago
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
ICCV
2003
IEEE
14 years 10 months ago
2003
IEEE
This paper presents a framework for finding point correspondences in monocular image sequences over multiple frames. The general problem of multi-frame point correspondence is NP ...
ICPR
2008
IEEE
14 years 3 months ago
2008
IEEE
Graph structures have been proved important in high level-vision since they can be used to represent structural and relational arrangements of objects in a scene. One of the probl...
LPNMR
2001
Springer
14 years 1 months ago
2001
Springer
Schlipf (Sch95) proved that Stable Logic Programming (SLP) solves all NP decision problems. We extend Schlipf’s result to prove that SLP solves all search problems in the class ...