80 search results - page 14 / 16 » A simple local 3-approximation algorithm for vertex cover |
ACCV
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. We propose a novel method for recognition of structured images and demonstrate it on detection of windows in facade images. Given an ability to obtain local low-level dat...
JDA
2007
13 years 7 months ago
2007
Given an undirected graph G = (V,E) and a source vertex s ∈ V , the k-traveling repairman (KTR) problem, also known as the minimum latency problem, asks for k tours, each starti...
CVPR
2007
IEEE
14 years 9 months ago
2007
IEEE
: This paper proposes a novel algorithm for calibrated multi-view stereopsis that outputs a (quasi) dense set of rectangular patches covering the surfaces visible in the input imag...
IROS
2008
IEEE
14 years 1 months ago
2008
IEEE
— We present a system for Monocular Simultaneous Localization and Mapping (Mono-SLAM) relying solely on video input. Our algorithm makes it possible to precisely estimate the cam...
ACIVS
2006
Springer
14 years 1 months ago
2006
Springer
When magnifying a bitmapped image, we want to increase the number of pixels it covers, allowing for finer details in the image, which are not visible in the original image. Simple...