39 search results - page 5 / 8 » On the Diameter of Lattice Polytopes |
JCT
2011
14 years 4 months ago
2011
The celebrated upper bound theorem of McMullen determines the maximal number of extreme points of a polyhedron in terms of its dimension and the number of constraints which define...
STOC
2006
ACM
15 years 10 months ago
2006
ACM
We present the first randomized polynomial-time simplex algorithm for linear programming. Like the other known polynomial-time algorithms for linear programming, its running time ...
CASES
2006
ACM
15 years 3 months ago
2006
ACM
Memory size reduction and memory accesses optimization are crucial issues for embedded systems. In the context of affine programs, these two challenges are classically tackled by ...
IJAR
2011
14 years 1 months ago
2011
The basic idea of an algebraic approach to learning Bayesian network (BN) structures is to represent every BN structure by a certain uniquely determined vector, called the standar...
ICIP
2007
IEEE
15 years 1 months ago
2007
IEEE
The search for alias-free sampling lattices for a given frequency support, in particular those lattices achieving minimum sampling densities, is a fundamental issue in various app...