2583 search results - page 221 / 517 » On the Representation of Timed Polyhedra |
137
click to vote
ICALP
2004
Springer
15 years 12 months ago
2004
Springer
We give a simple formulation of Karr’s algorithm for computing all affine relationships in affine programs. This simplified algorithm runs in time O(nk3 ) where n is the progr...
182
click to vote
WISA
2004
Springer
15 years 12 months ago
2004
Springer
In implementing cryptographic algorithms on limited devices such as smart cards, speed and memory optimization had always been a challenge. With the advent of side channel attacks,...
159
click to vote
DAWAK
2003
Springer
15 years 11 months ago
2003
Springer
In this paper we present a comprehensive log compression (CLC) method that uses frequent patterns and their condensed representations to identify repetitive information from large ...
162
Voted
ECCV
2010
Springer
15 years 11 months ago
2010
Springer
Abstract. We study the problem of multimodal dimensionality reduction assuming that data samples can be missing at training time, and not all data modalities may be present at appl...
173
click to vote
DATE
2010
IEEE
15 years 11 months ago
2010
IEEE
Abstract—Employing COTS components in real-time embedded systems leads to timing challenges. When multiple CPU cores and DMA peripherals run simultaneously, contention for access...