Sciweavers

1274 search results - page 31 / 255
» The Geometry of Coin-Weighing Problems
Sort
View
DIMACS
2001
13 years 9 months ago
Visibility Computations: From Discrete Algorithms to Real Algebraic Geometry
We investigate visibility computations with moving viewpoints. The initial problems are of discrete and algorithmic nature, but even for simple classes of objects (such as balls an...
Thorsten Theobald
CVPR
2012
IEEE
11 years 10 months ago
Joint 2D-3D temporally consistent semantic segmentation of street scenes
In this paper we propose a novel Conditional Random Field (CRF) formulation for the semantic scene labeling problem which is able to enforce temporal consistency between consecuti...
Georgios Floros, Bastian Leibe
COCOA
2008
Springer
13 years 9 months ago
Improved Primal-Dual Approximation Algorithm for the Connected Facility Location Problem
In the Connected Facility Location(ConFL) problem, we are given a graph G = (V, E) with nonnegative edge cost ce on the edges, a set of facilities F V , a set of demands, i.e., cl...
Hyunwoo Jung, Mohammad Khairul Hasan, Kyung-Yong C...
COMPGEOM
2009
ACM
14 years 2 months ago
Halving lines and measure concentration in the plane
Given a set of n points in the plane and a collection of k halving lines of P â„“1, . . . , â„“k indexed according to the increasing order of their slopes, we denote by d(â„“j, â„...
Rom Pinchasi
IROS
2006
IEEE
217views Robotics» more  IROS 2006»
14 years 1 months ago
Integrating Perception and Planning for Autonomous Navigation of Urban Vehicles
— The paper addresses the problem of autonomous navigation of a car-like robot evolving in an urban environment. Such an environment exhibits an heterogeneous geometry and is clu...
Rodrigo Benenson, Stéphane Petti, Thierry F...