Exploiting structure to cope with NP-hard graph problems: Polynomial and exponential time exact algorithms [PDF]
An ideal algorithm for solving a particular problem always finds an optimal solution, finds such a solution for every possible instance, and finds it in polynomial time.
VAN-'T-HOF, PIM
core
A new collaborative filtering algorithm using near-clique bipartite graph clusters
Recommendation systems are becoming increasingly crucial for everyday tasks such as choosing movies, discovering new songs, connecting to other people. These systems try to give the best recommendations as quickly as possible.
HÜSNÜ YILDIZ
core
Correland<sup>SW</sup>: Correlation Networks from LC-MS Data. [PDF]
Kosinova A, Gruz J.
europepmc +1 more source
Do Peer Cliques and Gender Differences Shape Adolescent Depression Under Bullying? Exploring the Mediating Power of Cognitive Biases. [PDF]
Wang X, Li C, Wang T.
europepmc +1 more source
Network analysis of anxiety, depression and insomnia in the elderly in Jiangsu Province. [PDF]
Han W +9 more
europepmc +1 more source
Identifying intra-hospital Norovirus GII transmission using whole-genome sequencing. [PDF]
Grimes L +10 more
europepmc +1 more source
Learning Continuous Decomposable Models Using Mutual Information and Statistical Copulas. [PDF]
Desuó Neto L +3 more
europepmc +1 more source
Quantum computing applications in drug discovery. [PDF]
Li J, Wei L, Tong HHY, Zou Q.
europepmc +1 more source
Interpreting higher-order dependence in multimorbidity using cohort data: A partial information decomposition approach. [PDF]
Hourican C +8 more
europepmc +1 more source

