Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

100

Voted

MOR
2010

93views more MOR 2010»

Maximal Lattice-Free Convex Sets in Linear Subspaces

14 years 10 months ago

Maximal Lattice-Free Convex Sets in Linear Subspaces

Download www.math.ucdavis.edu

Amitabh Basu, Michele Conforti, Gérard Corn

Real-time Traffic

MOR 2010 | Security Privacy |

claim paper

Related Content

» On Maximal SFree Convex Sets

» Lambertian Reflectance and Linear Subspaces

» Consensus set maximization with guaranteed global optimality for robust geometry estimatio...

» Online Learning of Mutually Orthogonal Subspaces for Face Recognition by Image Sets

» A fast linear separability test by projection of positive points on subspaces

» Subspace matching Unique solutions to point matching with geometric constraints

» Optimal Placement of Convex Polygons to Maximize Point Containment

» 2Player Nash and Nonsymmetric Bargaining Games Algorithms and Structural Properties

» Maximizing NonLinear Concave Functions in Fixed Dimension

Post Info
More Details (n/a)

Added	20 May 2011
Updated	20 May 2011
Type	Journal
Year	2010
Where	MOR
Authors	Amitabh Basu, Michele Conforti, Gérard Cornuéjols, Giacomo Zambelli

Comments (0)