Sciweavers

29 search results - page 3 / 6
» Faster Algorithms for Constructing a Concept (Galois) Lattic...
Sort
View
ICFCA
2004
Springer
13 years 11 months ago
AddIntent: A New Incremental Algorithm for Constructing Concept Lattices
Dean van der Merwe, Sergei A. Obiedkov, Derrick G....
SYRCODIS
2007
126views Database» more  SYRCODIS 2007»
13 years 7 months ago
Concept Lattice Reduction by Singular Value Decomposition
High complexity of lattice construction algorithms and uneasy way of visualising lattices are two important problems connected with the formal concept analysis. Algorithm complexi...
Václav Snásel, Martin Polovincak, Hu...
IACR
2011
136views more  IACR 2011»
12 years 5 months ago
Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
We give new methods for generating and using “strong trapdoors” in cryptographic lattices, which are simultaneously simple, efficient, easy to implement (even in parallel), a...
Daniele Micciancio, Chris Peikert
ISIM
2007
13 years 7 months ago
Using Matrix Decompositions in Formal Concept Analysis
One of the main problems connected with the formal concept analysis and lattice construction is the high complexity of algorithms which plays a significant role when computing all ...
Václav Snásel, Petr Gajdos, Hussam M...
ICSM
1997
IEEE
13 years 10 months ago
Identifying modules via concept analysis
ÐWe describe a general technique for identifying modules in legacy code. The method is based on concept analysisÐa branch of lattice theory that can be used to identify similarit...
Michael Siff, Thomas W. Reps