Sciweavers

463 search results - page 24 / 93
» The lattice dimension of a graph
Sort
View
72
Voted
CRYPTO
2006
Springer
119views Cryptology» more  CRYPTO 2006»
15 years 1 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...
FOIKS
2004
Springer
15 years 3 months ago
Equivalence of OLAP Dimension Schemas
Abstract. Dimension schemas are abstract models of the data hierarchies that populate OLAP warehouses. Although there is abundant work on schema equivalence in a variety of data mo...
Carlos A. Hurtado, Claudio Gutiérrez
IACR
2011
155views more  IACR 2011»
13 years 9 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...
JETAI
2002
71views more  JETAI 2002»
14 years 9 months ago
Comparing performance of algorithms for generating concept lattices
Several algorithms that generate the set of all formal concepts and diagram graphs of concept lattices are considered. Some modifications of wellknown algorithms are proposed. Algo...
Sergei O. Kuznetsov, Sergei A. Obiedkov
VISSYM
2007
15 years 2 days ago
Visualization of Uncertainty in Lattices to Support Decision-Making
Lattice graphs are used as underlying data structures in many statistical processing systems, including natural language processing. Lattices compactly represent multiple possible...
Christopher Collins, M. Sheelagh T. Carpendale, Ge...