A Simple Message Passing Algorithm for Graph Partitioning Problems. - Mikael Onsjö; Osamu Watanabe 001 (ISAAC, 2006)

Propagation Connectivity of Random Hypergraphs. - Robert Berke; Mikael Onsjö (SAGA, 2009)

Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions. - Mikael Onsjö; Osamu Watanabe 001 (Theory Comput. Syst., 2009)

Finding Most Likely Solutions. - Mikael Onsjö; Osamu Watanabe 001 (Theory Comput. Syst., 2009)

Propagation Connectivity of Random Hypergraphs. - Amin Coja-Oghlan; Mikael Onsjö; Osamu Watanabe 001 (Electron. J. Comb., 2012)

A Knowledge-based Filtering Story Recommender System for Theme Lovers with an Application to the Star Trek Television Franchise. - Paul Sheridan; Mikael Onsjö; Sergio Jiménez 001; George Dueñas (CoRR, 2018)

The Literary Theme Ontology for Media Annotation and Information Retrieval. - Paul Sheridan; Mikael Onsjö; Janna Hastings (JOWO, 2019)

An Ontology-Based Recommender System with an Application to the Star Trek Television Franchise. - Paul Sheridan; Mikael Onsjö; Claudia Jeanneth Becerra; Sergio Jiménez 001; George Dueñas (Future Internet, 2019)

A hypergeometric test interpretation of a common tf-idf variant. - Paul Sheridan; Mikael Onsjö (CoRR, 2020)

The hypergeometric test performs comparably to TF-IDF on standard text analysis tasks. - Paul Sheridan; Mikael Onsjö (Multim. Tools Appl., 2024)