Sciweavers

274 search results - page 29 / 55
» Counting lattice vectors
Sort
View
DCG
2002
66views more  DCG 2002»
14 years 11 months ago
A Commutative Algebra for Oriented Matroids
Let V be a vector space of dimension d over a field K and let A be a central arrangement of hyperplanes in V. To answer a question posed by K. Aomoto, P. Orlik and H. Terao constru...
Raul Cordovil
83
Voted
CIKM
2009
Springer
15 years 6 months ago
POkA: identifying pareto-optimal k-anonymous nodes in a domain hierarchy lattice
Data generalization is widely used to protect identities and prevent inference of sensitive information during the public release of microdata. The k-anonymity model has been exte...
Rinku Dewri, Indrajit Ray, Indrakshi Ray, Darrell ...
CRYPTO
2011
Springer
191views Cryptology» more  CRYPTO 2011»
13 years 11 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...
JC
2008
128views more  JC 2008»
14 years 11 months ago
Lattice rule algorithms for multivariate approximation in the average case setting
We study multivariate approximation for continuous functions in the average case setting. The space of d variate continuous functions is equipped with the zero mean Gaussian measu...
Frances Y. Kuo, Ian H. Sloan, Henryk Wozniakowski
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
Rankin's Constant and Blockwise Lattice Reduction
Abstract Lattice reduction is a hard problem of interest to both publickey cryptography and cryptanalysis. Despite its importance, extremely few algorithms are known. The best algo...
Nicolas Gama, Nick Howgrave-Graham, Henrik Koy, Ph...