In the CLOSEST SUBSTRING problem k strings s1, ..., sk are given, and the task is to find a string s of length L such that each string si has a consecutive substring of length L ...
Estimating geometric structure from uncalibrated images accurately enough for high quality rendering is difficult. We present a method where only coarse geometric structure is trac...
We study the propositional satisfiability problem (SAT) on classes of CNF formulas (formulas in Conjunctive Normal Form) that obey certain structural restrictions in terms of thei...
In this paper we introduce a novel Riemannian framework for shape analysis of parameterized surfaces. We derive a distance function between any two surfaces that is invariant to r...
Sebastian Kurtek, Eric Klassen, Anuj Srivastava, Z...
This paper describes a practical system developed for generating 3D models of human heads from silhouettes alone. The input to the system is an image sequence acquired from circula...