22 citations · 60 across the 7 of their papers we have counts for
7 papers
Classifying Unordered Feature Sets with Convolutional Deep Averaging Networks
Andrew Gardner, Jinko Kanno, Christian A. Duncan +1
Unordered feature sets are a nonstandard data structure that traditional neural networks are incapable of addressing in a principled manner. Providing a concatenation of features i…
On the Definiteness of Earth Mover's Distance and Its Relation to Set Intersection
Andrew Gardner, Christian A. Duncan, Jinko Kanno +1
Positive definite kernels are an important tool in machine learning that enable efficient solutions to otherwise difficult or intractable problems by implicitly linearizing the pro…
Planar and Poly-Arc Lombardi Drawings
Christian A. Duncan, David Eppstein, Michael T. Goodrich +2
In Lombardi drawings of graphs, edges are represented as circular arcs, and the edges incident on vertices have perfect angular resolution. However, not every graph has a Lombardi…
Optimal Polygonal Representation of Planar Graphs
Christian A. Duncan, Emden R. Gansner, Yifan Hu +2
In this paper, we consider the problem of representing graphs by polygons whose sides touch. We show that at least six sides per polygon are necessary by constructing a class of pl…
Drawing Trees with Perfect Angular Resolution and Polynomial Area
Christian A. Duncan, David Eppstein, Michael T. Goodrich +2
We study methods for drawing trees with perfect angular resolution, i.e., with angles at each node v equal to 2π/d(v). We show: 1. Any unordered tree has a crossing-free straight-l…
The Geometric Thickness of Low Degree Graphs
Christian A. Duncan, David Eppstein, Stephen G. Kobourov
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. All of our algorithms run in O(n) time, where n is the number of vertices in the g…