Sciweavers

985 search results - page 21 / 197
» Piercing Convex Sets
Sort
View
DATE
2007
IEEE
101views Hardware» more  DATE 2007»
14 years 2 months ago
Polynomial-time subgraph enumeration for automated instruction set extension
This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time ...
Paolo Bonzini, Laura Pozzi
MP
2008
99views more  MP 2008»
13 years 7 months ago
Compact formulations as a union of polyhedra
We explore one method for finding the convex hull of certain mixed integer sets. The approach is to break up the original set into a small number of subsets, find a compact polyhed...
Michele Conforti, Laurence A. Wolsey
CORR
2007
Springer
85views Education» more  CORR 2007»
13 years 7 months ago
Minimization of entropy functionals
Entropy (i.e. convex integral) functionals and extensions of these functionals are minimized on convex sets. This paper is aimed at reducing as much as possible the assumptions on ...
Christian Léonard
CCCG
2008
13 years 9 months ago
On a Cone Covering Problem
Given a set of polyhedral cones C1,
Khaled M. Elbassioni, Hans Raj Tiwary
CVPR
2010
IEEE
14 years 1 months ago
Face Recognition Based on Image Sets
We introduce a novel method for face recognition from image sets. In our setting each test and training example is a set of images of an individual’s face, not just a single ima...
Hakan Cevikalp, Bill Triggs