Sciweavers

184 search results - page 31 / 37
» Horn-Representation of a Concept Lattice
Sort
View
JCSS
2008
73views more  JCSS 2008»
13 years 9 months ago
Structure identification of Boolean relations and plain bases for co-clones
We give a quadratic algorithm for the following structure identification problem: given a Boolean relation R and a finite set S of Boolean relations, can the relation R be express...
Nadia Creignou, Phokion G. Kolaitis, Bruno Zanutti...
ICCS
2003
Springer
14 years 3 months ago
Formalizing Botanical Taxonomies
Because botanical taxonomies are prototypical classifications it would seem that it should be easy to formalize them as concept lattices or type hierarchies. On closer inspection,...
Uta Priss
CLA
2007
13 years 11 months ago
Precalculating Component Interface Compatibility using FCA
In component-based software engineering, software systems are built by assembling prefabricated reusable components. The compatibility between the assembled components is crucial. ...
Gabriela Arévalo, Nicolas Desnos, Marianne ...
DM
2007
84views more  DM 2007»
13 years 9 months ago
Matroids on convex geometries (cg-matroids)
We consider matroidal structures on convex geometries, which we call cg-matroids. The concept of a cg-matroid is closely related to but different from that of a supermatroid intro...
Satoru Fujishige, Gleb A. Koshevoy, Yoshio Sano
CVPR
2008
IEEE
14 years 11 months ago
Joint data alignment up to (lossy) transformations
Joint data alignment is often regarded as a data simplification process. This idea is powerful and general, but raises two delicate issues. First, one must make sure that the usef...
Andrea Vedaldi, Gregorio Guidi, Stefano Soatto