6740 search results - page 92 / 1348 » An s -Hamiltonian Line Graph Problem |
AAAI
2010
13 years 11 months ago
2010
We report a new error-aware monocular visual odometry method that only uses vertical lines, such as vertical edges of buildings and poles in urban areas as landmarks. Since vertic...
CVPR
2012
IEEE
12 years 16 days ago
2012
IEEE
Recovering 3D geometry from a single 2D line drawing is an important and challenging problem in computer vision. It has wide applications in interactive 3D modeling from images, c...
ISAAC
2009
Springer
14 years 4 months ago
2009
Springer
Given m unit disks and n points in the plane, the discrete unit disk cover problem is to select a minimum subset of the disks to cover the points. This problem is NP-hard [11] and ...
DCC
2010
IEEE
13 years 10 months ago
2010
IEEE
Linear sets generalise the concept of subgeometries in a projective space. They have many applications in finite geometry. In this paper we address two problems for linear sets: t...
MST
2008
13 years 10 months ago
2008
We study the problem of on-line scheduling on two uniformly related machines where the on-line algorithm has resources different from those of the off-line algorithm. We consider ...