Sciweavers

1132 search results - page 28 / 227
» Applications of multi-objective structure optimization
Sort
View
PKC
2010
Springer
138views Cryptology» more  PKC 2010»
15 years 5 months ago
Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA
We present an elementary method to construct optimized lattices that are used for finding small roots of polynomial equations. Former methods first construct some large lattice i...
Mathias Herrmann, Alexander May
PPOPP
2011
ACM
14 years 4 months ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
IEEEMSP
2002
IEEE
15 years 6 months ago
Factorization with missing data for 3D structure recovery
—Matrix factorization methods are now widely used to recover 3D structure from 2D projections [1]. In practice, the observation matrix to be factored out has missing data, due to...
Rui F. C. Guerreiro, Pedro M. Q. Aguiar
CASES
2007
ACM
15 years 5 months ago
Compiler generation from structural architecture descriptions
With increasing complexity of modern embedded systems, the availability of highly optimizing compilers becomes more and more important. At the same time, application specific inst...
Florian Brandner, Dietmar Ebner, Andreas Krall
ENTCS
2002
79views more  ENTCS 2002»
15 years 1 months ago
Debugging and Testing Optimizers through Comparison Checking
We present a novel technique called comparison checking that helps optimizer writers debug optimizers by testing, for given inputs, that the semantics of a program are not changed...
Clara Jaramillo, Rajiv Gupta, Mary Lou Soffa