Sciweavers

4 search results - page 1 / 1
» Lattice Enumeration Using Extreme Pruning
Sort
View
EUROCRYPT
2010
Springer
13 years 9 months ago
Lattice Enumeration Using Extreme Pruning
Nicolas Gama, Phong Q. Nguyen, Oded Regev
ANTS
2010
Springer
246views Algorithms» more  ANTS 2010»
13 years 8 months ago
On the Extremality of an 80-Dimensional Lattice
Abstract. We show that a specific even unimodular lattice of dimension 80, first investigated by Schulze-Pillot and others, is extremal (i.e., the minimal nonzero norm is 8). Thi...
Damien Stehlé, Mark Watkins
CVPR
2000
IEEE
14 years 6 months ago
Robust and Efficient Skeletal Graphs
There has recently been significant interest in using repions based on abstractions of Blum's skeleton into a graph, for qualitative shape matching. The application of these ...
Pavel Dimitrov, Carlos Phillips, Kaleem Siddiqi
CGO
2006
IEEE
13 years 10 months ago
Exhaustive Optimization Phase Order Space Exploration
The phase-ordering problem is a long standing issue for compiler writers. Most optimizing compilers typically have numerous different code-improving phases, many of which can be a...
Prasad Kulkarni, David B. Whalley, Gary S. Tyson, ...