From post

On the Maximal Independence Polynomial of the Covering Graph of the Hypercube up to n=6.

. ICFCA, том 13934 из Lecture Notes in Computer Science, стр. 152-165. Springer, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

 

Другие публикации лиц с тем же именем

A Note on the Number of (Maximal) Antichains in the Lattice of Set Partitions.. ICCS, том 14133 из Lecture Notes in Computer Science, стр. 56-69. Springer, (2023)Towards Interaction-based User Embeddings in Sequential Recommender Models., , , , и . ORSUM@RecSys, том 3303 из CEUR Workshop Proceedings, CEUR-WS.org, (2022)A One-pass Triclustering Approach: Is There any Room for Big Data?, , , и . CLA, том 1252 из CEUR Workshop Proceedings, стр. 231-242. CEUR-WS.org, (2014)Understanding Collaborative Filtering with Galois Connections., и . FCA4AI@IJCAI, том 2149 из CEUR Workshop Proceedings, стр. 127-143. CEUR-WS.org, (2018)Formal concept analysis 10th International Conference, ICFCA 2012, Leuven, Belgium, May 7-10, 2012. Proceedings, , , и . Berlin; New York, Springer, (2012)On the Cryptomorphism between Davis' Subset Lattices, Atomic Lattices, and Closure Systems under T1 Separation Axiom.. CoRR, (2022)How University Entrants are Choosing Their Department? Mining of University Admission Process with FCA Taxonomies., , и . EDM, стр. 229-234. www.educationaldatamining.org, (2011)Semi-automated knowledge discovery: identifying and profiling human trafficking., , , и . Int. J. General Systems, 41 (8): 774-804 (2012)Interpretable Concept-Based Classification with Shapley Values., и . ICCS, том 12277 из Lecture Notes in Computer Science, стр. 90-102. Springer, (2020)Multilingual hope speech detection: A Robust framework using transfer learning of fine-tuning RoBERTa model., , , и . J. King Saud Univ. Comput. Inf. Sci., 35 (8): 101736 (сентября 2023)