2 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.LG2017★ 2 cited
Classification on Large Networks: A Quantitative Bound via Motifs and Graphons
Andreas Haupt, Mohammad Khatami, Thomas Schultz +1
When each data point is a large graph, graph statistics such as densities of certain subgraphs (motifs) can be used as feature vectors for machine learning. While intuitive, motif…
math.OC2015★ 2 cited
Antibiotics Time Machine is NP-hard
Ngoc Mai Tran, Jed Yang
The antibiotics time machine is an optimization question posed by Mira \latin{et al.} on the design of antibiotic treatment plans to minimize antibiotic resistance. The problem is…