Sciweavers

390 search results - page 10 / 78
» Set Intersection Theorems and Existence of Optimal Solutions
Sort
View
COMPGEOM
1998
ACM
13 years 12 months ago
Rotational Polygon Containment and Minimum Enclosure
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
Victor Milenkovic
GECCO
2006
Springer
162views Optimization» more  GECCO 2006»
13 years 11 months ago
Evolutionary learning with kernels: a generic solution for large margin problems
In this paper we embed evolutionary computation into statistical learning theory. First, we outline the connection between large margin optimization and statistical learning and s...
Ingo Mierswa
LICS
2002
IEEE
14 years 17 days ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
CVIU
2006
169views more  CVIU 2006»
13 years 7 months ago
A generic structure-from-motion framework
We introduce a generic structure-from-motion approach based on a previously introduced, highly general imaging model, where cameras are modeled as possibly unconstrained sets of p...
Srikumar Ramalingam, Suresh K. Lodha, Peter F. Stu...
CVPR
2012
IEEE
11 years 10 months ago
Globally optimal line clustering and vanishing point estimation in Manhattan world
The projections of world parallel lines in an image intersect at a single point called the vanishing point (VP). VPs are a key ingredient for various vision tasks including rotati...
Jean Charles Bazin, Yongduek Seo, Cédric De...