13 search results - page 2 / 3 » Rough Lattices |
FSS
2007
13 years 5 months ago
2007
Formal concept analysis and rough set theory are two important tools in knowledge representation and knowledge discovery in relational information systems. The purpose of this pap...
ISAAC
2003
Springer
13 years 11 months ago
2003
Springer
We propose a new lattice reduction method. Our algorithm approximates shortest lattice vectors up to a factor ≤ (k/6)n/2k and makes use of Grover’s quantum search algorithm. Th...
SIGMOD
2004
ACM
14 years 5 months ago
2004
ACM
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
RSCTC
1998
Springer
13 years 10 months ago
1998
Springer
This paper reviews and discusses generalizations of Pawlak rough set approximation operators in mathematical systems, such as topological spaces, closure systems, lattices, and pos...
ASIACRYPT
2009
Springer
14 years 11 days ago
2009
Springer
Abstract. We describe a public-key encryption scheme based on lattices — specifically, based on the hardness of the learning with error (LWE) problem — that is secure against ...