Search Results for author:
Found 3 papers, 1 papers with code
Heuristic Algorithms for the Approximation of Mutual Coherence
Moreover, for every subset, an instance of the SAT model counting problem has to be solved which is known to be a hard problem in computer science.
Can an NN model plainly learn planar layouts?
Planar graph drawings tend to be aesthetically pleasing.
Aesthetic Discrimination of Graph Layouts
The mean prediction accuracy of our model is 95. 70%, outperforming discriminators based on stress and on the linear combination of popular quality metrics by a statistically significant margin.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
