Sciweavers

730 search results - page 2 / 146
» Faster dimension reduction
Sort
View
JSAT
2008
89views more  JSAT 2008»
13 years 6 months ago
Towards a Classification of Hamiltonian Cycles in the 6-Cube
In this paper, we consider the problem of classifying Hamiltonian cycles in a binary hypercube. Previous work proposed a classification of these cycles using the edge representati...
Yury Chebiryak, Daniel Kroening
AFRICACRYPT
2010
Springer
14 years 1 months ago
Parallel Shortest Lattice Vector Enumeration on Graphics Cards
In this paper we present an algorithm for parallel exhaustive search for short vectors in lattices. This algorithm can be applied to a wide range of parallel computing systems. To ...
Jens Hermans, Michael Schneider 0002, Johannes Buc...
ICCAD
2006
IEEE
100views Hardware» more  ICCAD 2006»
14 years 3 months ago
Faster, parametric trajectory-based macromodels via localized linear reductions
— Trajectory-based methods offer an attractive methodology for automated, on-demand generation of macromodels for custom circuits. These models are generated by sampling the stat...
Saurabh K. Tiwary, Rob A. Rutenbar
ISAAC
2003
Springer
115views Algorithms» more  ISAAC 2003»
13 years 11 months ago
A Faster Lattice Reduction Method Using Quantum Search
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
Christoph Ludwig