Sciweavers

7758 search results - page 47 / 1552
» On the Number of Distributive Lattices
Sort
View
STOC
2005
ACM
93views Algorithms» more  STOC 2005»
14 years 9 months ago
Representing hard lattices with O(n log n) bits
We present a variant of the Ajtai-Dwork public-key cryptosystem where the size of the public-key is only O(n log n) bits and the encrypted text/clear text ratio is also O(n log n)...
Miklós Ajtai
ICFCA
2009
Springer
14 years 3 months ago
Yet a Faster Algorithm for Building the Hasse Diagram of a Concept Lattice
Formal concept analysis (FCA) is increasingly applied to data mining problems, essentially as a formal framework for mining reduced representations (bases) of target pattern famili...
Jaume Baixeries, Laszlo Szathmary, Petko Valtchev,...
JCT
2007
111views more  JCT 2007»
13 years 8 months ago
Lattice point counts for the Shi arrangement and other affinographic hyperplane arrangements
Hyperplanes of the form xj = xi + c are called affinographic. For an affinographic hyperplane arrangement in Rn, such as the Shi arrangement, we study the function f(m) that counts...
David Forge, Thomas Zaslavsky
TCC
2010
Springer
178views Cryptology» more  TCC 2010»
14 years 5 months ago
Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems
We present a variant of Regev’s cryptosystem first presented in [Reg05], but with a new choice of parameters. By a recent classical reduction by Peikert we prove the scheme sema...
Rikke Bendlin, Ivan Damgård
EUSFLAT
2007
125views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
On the Moments and the Distribution of the Choquet Integral
We investigate the distribution functions and the moments of the so-called Choquet integral, also known as the Lov´asz extension, when regarded as a real function of a random sam...
Ivan Kojadinovic, Jean-Luc Marichal