Sciweavers

1814 search results - page 166 / 363
» Improved Results on Geometric Hitting Set Problems
Sort
View
CVPR
2012
IEEE
13 years 9 months ago
Recovering free space of indoor scenes from a single image
In this paper we consider the problem of recovering the free space of an indoor scene from its single image. We show that exploiting the box like geometric structure of furniture ...
Varsha Hedau, Derek Hoiem, David A. Forsyth
COMPGEOM
2003
ACM
15 years 11 months ago
The smallest enclosing ball of balls: combinatorial structure and algorithms
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
Kaspar Fischer, Bernd Gärtner
IPCO
2007
98views Optimization» more  IPCO 2007»
15 years 8 months ago
Scheduling with Precedence Constraints of Low Fractional Dimension
Abstract. We consider the single machine scheduling problem to minimize the average weighted completion time under precedence constrains. Improving on the various 2-approximation a...
Christoph Ambühl, Monaldo Mastrolilli, Nikola...
ICCVW
1999
Springer
15 years 10 months ago
Optimization Criteria, Sensitivity and Robustness of Motion and Structure Estimation
The prevailing efforts to study the standard formulation of motion and structure recovery have been recently focused on issues of sensitivity and and robustness of existing techn...
Jana Kosecka, Yi Ma, Shankar Sastry
GECCO
2005
Springer
125views Optimization» more  GECCO 2005»
16 years 1 days ago
Schema disruption in tree-structured chromosomes
We study if and when the inequality dp(H) ≤ rel∆(H) holds for schemas H in chromosomes that are structured as trees. The disruption probability dp(H) is the probability that a...
William A. Greene