Polynomially solvable cases of the constant rank unconstrained quadratic 0-1 programming problem

E Çela, B Klinz, C Meyer - Journal of combinatorial optimization, 2006 - Springer
In this paper we consider the constant rank unconstrained quadratic 0-1 optimization problem,
CR-QP01 for short. This problem consists in minimizing the quadratic function <x, Ax> + <c…

Lattice congruences, fans and Hopf algebras

N Reading - Journal of Combinatorial Theory, Series A, 2005 - Elsevier
… The fan F is the normal fan to a zonotope which is the Minkowski sum of the normal
vectors to the hyperplanes. The dimension of the zonotope is the rank of the arrangement. In …

Comparison between two state estimation techniqueds for linear systems

D Merhy, C Stoica, T Alamo, EF Camacho… - 2007 - idus.us.es
This paper presents a comparison in terms of accuracy and complexity between two approaches
used for state estimation of linear systems: a classic Kalman filter and a guaranteed set-…

Optimized color gamuts for tiled displays

M Bern, D Eppstein - Proceedings of the nineteenth annual symposium …, 2003 - dl.acm.org
We consider the problem of finding a large color space that can be generated by all units in
multi-projector tiled display systems. Viewing the problem geometrically as one of finding a …

Discrete lines and wandering paths

A Vince - SIAM Journal on Discrete Mathematics, 2007 - SIAM
The problem of finding an approximation to a geometric line by a discrete line using pixels
is ubiquitous in computer graphics applications. We show that this discrete line problem in ${\…

[HTML][HTML] Activity preserving bijections between spanning trees and orientations in graphs

E Gioan, M Las Vergnas - Discrete mathematics, 2005 - Elsevier
The main results of the paper are two dual algorithms bijectively mapping the set of spanning
trees with internal activity 1 and external activity 0 of an ordered graph onto the set of …

Algorithms for graded injective resolutions and local cohomology over semigroup rings

D Helm, E Miller - Journal of Symbolic Computation, 2005 - Elsevier
Let Q be an affine semigroup generating Z d , and fix a finitely generated Z d -graded module
M over the semigroup algebra k [ Q ] for a field k . We provide an algorithm to compute a …

In between k-sets, j-facets, and i-faces:(i, j)-partitions

A Andrzejak, E Welzl - Discrete and Computational geometry, 2003 - Springer
Let S be a finite set of points in general position in R d . We call a pair (A,B) of subsets of S
an (i,j) -partition of S if |A|=i , |B|=j and there is an oriented hyperplane h with S $\cap$ h=A …

Form defects tolerancing by natural modes analysis

S Samper, F Formosa - 2007 - asmedigitalcollection.asme.org
The form defects quality needs methods to express allowable deviations. We propose a
new language for form defects expression. This one is based on natural mode shapes of a …

20 POLY TOPE SKELETONS AND PATHS

G Kalai - Handbook of discrete and computational geometry, 2004 - books.google.com
… 29 Babson, Finschi, and Fukuda [BFF01) Duals of cubical zonotopes are determined by
their graphs. In all instances of the above theorems except the single case of the theorem of …