Sciweavers

613 search results - page 92 / 123
» Generalized Traveling Salesman Problem Reduction Algorithms
Sort
View
CASES
2006
ACM
14 years 2 months ago
Memory optimization by counting points in integer transformations of parametric polytopes
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 ...
Rachid Seghir, Vincent Loechner
ICDE
1999
IEEE
126views Database» more  ICDE 1999»
14 years 10 months ago
Improving the Access Time Performance of Serpentine Tape Drives
This paper presents a general model for estimating access times of serpentine tape drives. The model is used to schedule I/O requests in order to minimize the total access time. W...
Olav Sandstå, Roger Midtstraum
WACV
2005
IEEE
14 years 2 months ago
Ensemble Methods in the Clustering of String Patterns
We address the problem of clustering of contour images from hardware tools based on string descriptions, in a comparative study of cluster combination techniques. Several clusteri...
André Lourenço, Ana L. N. Fred
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
14 years 2 months ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
CRYPTO
2004
Springer
86views Cryptology» more  CRYPTO 2004»
14 years 2 months ago
On Multiple Linear Approximations
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
Alex Biryukov, Christophe De Cannière, Mich...