Sciweavers

107 search results - page 4 / 22
» On derivations of lattices
Sort
View
EUSFLAT
2003
13 years 11 months ago
Capacities on lattices and k-ary capacities
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...
Michel Grabisch, Christophe Labreuche
ISCAS
2005
IEEE
139views Hardware» more  ISCAS 2005»
14 years 3 months ago
The missing observations theorem and a new proof of Levinson's recursion
— 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...
Charles W. Therrien
ICPR
2010
IEEE
13 years 7 months ago
Shape Interpolation with Flattenings
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...
Fernand Meyer
JCT
2011
104views more  JCT 2011»
13 years 4 months ago
Bounds for solid angles of lattices of rank three
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...
Lenny Fukshansky, Sinai Robins
PKC
2007
Springer
100views Cryptology» more  PKC 2007»
14 years 3 months ago
Multi-bit Cryptosystems Based on Lattice Problems
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...
Akinori Kawachi, Keisuke Tanaka, Keita Xagawa