We propose a general notion of capacity defined on any finite distributive lattice, encompassing usual capacities, bi-capacities, and their immediate extensions called k-ary cap...
— A principle of linear mean-square estimation which we call the “missing observations theorem” is presented here and used to provide a simple alternative derivation of Levin...
This paper presents the binary flattenings of shapes, first as a connected operator suppressing particles or holes, second as an erosion in a particular lattice of shapes. Using t...
We find sharp absolute constants C1 and C2 with the following property: every well-rounded lattice of rank 3 in a Euclidean space has a minimal basis so that the solid angle spann...
Abstract. We propose multi-bit versions of several single-bit cryptosystems based on lattice problems, the error-free version of the Ajtai-Dwork cryptosystem by Goldreich, Goldwass...