Sciweavers

5 search results - page 1 / 1
» fct 2011
Sort
View
FCT
2011
Springer
12 years 7 months ago
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen...
BILDMED
2011
313views Algorithms» more  BILDMED 2011»
12 years 11 months ago
Automatic Multi-modal ToF/CT Organ Surface Registration
Abstract. In the field of image-guided liver surgery (IGLS), the initial registration of the intra-operative organ surface with preoperative tomographic image data is performed on...
Kerstin Müller, Sebastian Bauer, Jakob Wasza,...
IACR
2011
155views more  IACR 2011»
12 years 7 months ago
Terminating BKZ
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
12 years 7 months ago
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Strong lattice reduction is the key element for most attacks against lattice-based cryptosystems. Between the strongest but impractical HKZ reduction and the weak but fast LLL redu...
Guillaume Hanrot, Xavier Pujol, Damien Stehl&eacut...