Linear Relation Analysis [CH78] suffers from the cost of operations on convex polyhedra, which can be exponential with the number of involved variables. In order to reduce this cost, we propose to detect when a polyhedron is a Cartesian product of polyhedra of lower dimensions, i.e., when groups of variables are unrelated with each other. Classical operations are adapted to work on such factored polyhedra. Our implementation shows encouraging experimental results. © Springer-Verlag Berlin Heidelberg 2003.
CITATION STYLE
Halbwachs, N., Merchat, D., & Parent-Vigoureux, C. (2003). Cartesian factoring of polyhedra in linear relation analysis. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2694, 355–365. https://doi.org/10.1007/3-540-44898-5_20
Mendeley helps you to discover research relevant for your work.