We approach the problem of 2-D and 3-D puzzle solving by matching the geometric features of puzzle pieces three at a time. First, we define an affinity measure for a pair of piece...
We propose a principled account on multiclass spectral clustering. Given a discrete clustering formulation, we first solve a relaxed continuous optimization problem by eigendecomp...
With the advances in digital imagery, large accessible data storage, internet repositories, and image applications, information conveyed through images is gaining in importance. T...
ns, with large, abstract, multidimensional data sets that are visually represented in multiple ways. We illustrate how spreadsheet techniques provide a structured, intuitive, and p...
Ed Huai-hsin Chi, John Riedl, Phillip Barry, Josep...
In this paper, we propose a new algorithm for proving the validity or invalidity of a pre/postcondition pair for a program. The algorithm is motivated by the success of the algori...