Sciweavers

557 search results - page 35 / 112
» On the set multi-cover problem in geometric settings
Sort
View
PAMI
1998
93views more  PAMI 1998»
13 years 8 months ago
Stereo Matching as a Nearest-Neighbor Problem
—We propose a representation of images, called intrinsic curves, that transforms stereo matching from a search problem into a nearest-neighbor problem. Intrinsic curves are the p...
Carlo Tomasi, Roberto Manduchi
COMPGEOM
2003
ACM
14 years 2 months ago
the asteroid surveying problem and other puzzles
We consider two variants of the well-known “sailor in the fog” puzzle. The first version (the “asteroid surveying” problem) is set in three dimensions and asks for the sh...
Timothy M. Chan, Alexander Golynski, Alejandro L&o...
IPCO
2008
91views Optimization» more  IPCO 2008»
13 years 10 months ago
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Abstract. Determining the integrality gap of the bidirected cut relaxation for the metric Steiner tree problem, and exploiting it algorithmically, is a long-standing open problem. ...
Deeparnab Chakrabarty, Nikhil R. Devanur, Vijay V....
IJIG
2008
222views more  IJIG 2008»
13 years 9 months ago
An Analytical Solution to the Perspective-n-Point Problem for Common Planar Camera and for Catadioptric Sensor
The Perspective-N-Point problem (PNP) is a notable problem in computer vision. It consists in, given N points known in an object coordinate space and their projection onto the ima...
Jonathan Fabrizio, Jean Devars
ICA
2007
Springer
14 years 3 months ago
On Separation of Signal Sources Using Kernel Estimates of Probability Densities
The discussion in this paper revolves around the notion of separation problems. The latter can be thought of as a unifying concept which includes a variety of important problems in...
Oleg V. Michailovich, Douglas Wiens