1144 search results - page 174 / 229 » Fractal Algorithm for Finding Global Optimal Solution |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
106
click to vote
SIAMCOMP
2008
14 years 9 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
101
click to vote
ACCV
2010
Springer
14 years 4 months ago
2010
Springer
Accurate localization of the salient object from an image is a difficult problem when the saliency map is noisy and incomplete. A fast approach to detect salient objects from image...
ISCSCT
2008
IEEE
15 years 4 months ago
2008
IEEE
—In this paper, we present a novel method to reconstruct the large scale scenes from multiple calibrated images. It first generates a quasi-dense 3D point cloud of the scene by m...
SIGGRAPH
2000
ACM
15 years 2 months ago
2000
ACM
Subdivision surfaces solve numerous problems related to the geometry of character and animation models. However, unlike on parametrised surfaces there is no natural choice of text...