Stop the war!
Остановите войну!
for scientists:
default search action
Discrete Applied Mathematics, Volume 249
Volume 249, November 2018
- Karell Bertet, Sebastian Rudolph:
Preface: Concept Lattices and Applications: Recent Advances and New Opportunities. 1 - Mehwish Alam, Aleksey Buzmakov, Amedeo Napoli:
Exploratory knowledge discovery over Web of Data. 2-17 - Jaume Baixeries, Víctor Codocedo, Mehdi Kaytoue, Amedeo Napoli:
Characterizing approximate-matching dependencies in formal concept analysis with pattern structures. 18-27 - Alexandre Bazin:
A depth-first search algorithm for computing pseudo-closed sets. 28-35 - Radim Belohlávek, Martin Trnecka:
A new algorithm for Boolean matrix factorization which admits overcovering. 36-52 - Lankun Guo, Qingguo Li, Lingjuan Yao:
Locally complete consistent F-augmented contexts: A category-theoretic representation of algebraic L-domains. 53-63 - Michel Habib, Lhouari Nourine:
Representation of lattices via set-colored posets. 64-73 - Dmitry I. Ignatov:
On closure operators related to maximal tricliques in tripartite hypergraphs. 74-84 - Léonard Kwuida:
A single axiom for Boolean algebras. 85-90 - Khaled Maafa, Lhouari Nourine, Mohammed Said Radjef:
Algorithms for computing the Shapley value of cooperative games on lattices. 91-105 - Estrella Rodríguez Lorenzo, Karell Bertet, Pablo Cordero, Manuel Enciso, Ángel Mora:
Direct-optimal basis computation by means of the fusion of simplification rules. 106-119 - Hirohisa Seki, Masahiro Nagao:
Parallel algorithms for enumerating closed patterns from multi-relational data. 120-134 - Jean-François Viaud, Karell Bertet, Rokia Missaoui, Christophe Demko:
Using congruence relations to extract knowledge from concept lattices. 135-150
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.