In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
— We address the problem of connection preemption in a multi-class network environment. Our objective is: i) to minimize the number of preempted connections, and ii) to minimize ...
Mesh generation for finite element analysis is far from a solved problem. Although several automatic meshing algorithms exist, other difficulties of setting up a problem for finit...
Timothy J. Tautges, David R. White, Robert W. Lela...
We describe a learning-based method for low-level vision problems--estimating scenes from images. We generate a synthetic world of scenes and their corresponding rendered images, m...