We present a fast graph cut algorithm for planar graphs.
It is based on the graph theoretical work [2] and leads to an
efficient method that we apply on shape matching and im-
a...
We describe how certain tasks in the audio domain can be effectively addressed using computer vision approaches. This paper focuses on the problem of music identification, where t...
Given observed data and a collection of parameterized candidate models, a 1- confidence region in parameter space provides useful insight as to those models which are a good fit t...
Brent Bryan, H. Brendan McMahan, Chad M. Schafer, ...
Given a matrix A, it is often desirable to find a good approximation to A that has low rank. We introduce a simple technique for accelerating the computation of such approximation...
Mitigating the impact of computer failure is possible if accurate failure predictions are provided. Resources, applications, and services can be scheduled around predicted failure...