We consider the problem of image representation and clustering. Traditionally, an n1 × n2 image is represented by a vector in the Euclidean space Rn1×n2 . Some learning algorith...
Motivated by the question of the polytopal realizability of the simplicial complex n,k of (k + 1)-crossing-free sets of diagonals of the convex n-gon, we study the first open case...
We visualize the structure of sections of the World Wide Web by constructing graphical representations in 3D hyperbolic space. The felicitous property that hyperbolic space has â€...
A major enterprise in compressed sensing and sparse approximation is the design and analysis of computationally tractable algorithms for recovering sparse, exact or approximate, s...
Jeffrey D. Blanchard, Coralia Cartis, Jared Tanner...
We develop a new framework for the quantitative analysis of shapes of planar curves. Shapes are modeled on elastic strings that can be bent, stretched or compressed at different r...