Sciweavers

7758 search results - page 19 / 1552
» On the Number of Distributive Lattices
Sort
View
PKDD
2000
Springer
113views Data Mining» more  PKDD 2000»
14 years 5 days ago
CEM-Visualisation and Discovery in Email
Abstract. This paper presents a lattice-based visual metaphor for knowledge discovery in electronic mail. It allow a user to navigate email using a visual lattice metaphor rather t...
Richard J. Cole II, Peter W. Eklund, Gerd Stumme
DLOG
2008
13 years 11 months ago
Realization Problem for Formal Concept Analysis
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
Nikolay Shilov
ECCC
2007
185views more  ECCC 2007»
13 years 8 months ago
Trapdoors for Hard Lattices and New Cryptographic Constructions
We show how to construct a variety of “trapdoor” cryptographic tools assuming the worst-case hardness of standard lattice problems (such as approximating the length of the sho...
Craig Gentry, Chris Peikert, Vinod Vaikuntanathan
IPPS
2000
IEEE
14 years 1 months ago
Implementation of Finite Lattices in VLSI for Fault-State Encoding in High-Speed Networks
In this paper the propagation of information about fault states and its implementation in high-speed networks is discussed. The algebraic concept of a lattice partial ordered set ...
Andreas C. Döring, Gunther Lustig
EUSFLAT
2003
13 years 10 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