ITEM METADATA RECORD
Title: Analytical computation of Ehrhart polynomials and its applications for embedded systems
Authors: Verdoolaege, Sven ×
Beyls, Kristof
Bruynooghe, Maurice
Seghir, Rachid
Loechner, Vincent #
Issue Date: 2004
Host Document: Digest of the 2nd Workshop on Optimizations for DSP and Embedded Systems (ODES-2)
Conference: 2nd Workshop on Optimizations for DSP and Embedded Systems location:Palo Alto, USA date:March 21, 2004
Abstract: Many optimization techniques, including several targeted specifically
at embedded systems, depend on the ability to calculate
the number of points in a parametrized polytope.
It is well known that this parametrized count can be represented
by an Ehrhart polynomial, which is usually computed through interpolation.
In some cases, however, this interpolation fails and in some other
cases it can take a very long time to compute.
By extending an existing method, based on Barvinok's decomposition,
to count the number of points in an non-parameterized polytope
we show that we can compute the Ehrhart polynomial {\em analytically},
solving these problems to a large extent.
Description: Slides
Publication status: published
KU Leuven publication type: IMa
Appears in Collections:Informatics Section
× corresponding author
# (joint) last author

Files in This Item:
File Description Status SizeFormat
abstract.pdfAbstract Submitted 148KbAdobe PDFView/Open
slides.pdfPresentation Submitted 736KbAdobe PDFView/Open

 


All items in Lirias are protected by copyright, with all rights reserved.