default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMikael Onsjö
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j5]Paul Sheridan
, Mikael Onsjö:
The hypergeometric test performs comparably to TF-IDF on standard text analysis tasks. Multim. Tools Appl. 83(10): 28875-28890 (2024)- 2020
- [i3]Paul Sheridan, Mikael Onsjö:
A hypergeometric test interpretation of a common tf-idf variant. CoRR abs/2002.11844 (2020)
2010 – 2019
- 2019
- [j4]Paul Sheridan, Mikael Onsjö, Claudia Jeanneth Becerra, Sergio Jiménez, George Dueñas:
An Ontology-Based Recommender System with an Application to the Star Trek Television Franchise. Future Internet 11(9): 182 (2019) - [c5]Paul Sheridan, Mikael Onsjö, Janna Hastings:
The Literary Theme Ontology for Media Annotation and Information Retrieval. JOWO 2019 - [i2]Paul Sheridan, Mikael Onsjö, Janna Hastings:
The Literary Theme Ontology for Media Annotation and Information Retrieval. CoRR abs/1905.00522 (2019) - 2018
- [i1]Paul Sheridan, Mikael Onsjö, Sergio Jiménez, George Dueñas:
A Knowledge-based Filtering Story Recommender System for Theme Lovers with an Application to the Star Trek Television Franchise. CoRR abs/1808.00103 (2018) - 2012
- [j3]Amin Coja-Oghlan, Mikael Onsjö, Osamu Watanabe:
Propagation Connectivity of Random Hypergraphs. Electron. J. Comb. 19(1): 17 (2012) - 2010
- [c4]Amin Coja-Oghlan, Mikael Onsjö, Osamu Watanabe:
Propagation Connectivity of Random Hypergraphs. APPROX-RANDOM 2010: 490-503
2000 – 2009
- 2009
- [j2]Mikael Onsjö, Osamu Watanabe:
Theory of Computing Systems (TOCS) Submission Version Finding Most Likely Solutions. Theory Comput. Syst. 45(4): 926-942 (2009) - [j1]Mikael Onsjö, Osamu Watanabe:
Finding Most Likely Solutions. Theory Comput. Syst. 45(4): 943 (2009) - [c3]Robert Berke, Mikael Onsjö:
Propagation Connectivity of Random Hypergraphs. SAGA 2009: 117-126 - 2007
- [c2]Osamu Watanabe, Mikael Onsjö:
Finding Most Likely Solutions. CiE 2007: 758-767 - 2006
- [c1]Mikael Onsjö, Osamu Watanabe:
A Simple Message Passing Algorithm for Graph Partitioning Problems. ISAAC 2006: 507-516
Coauthor Index
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.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
