Many computer vision algorithms require searching a set of images for similar patches, which is a very expensive operation. In this work, we compare and evaluate a number of neares...
The HMM (Hidden Markov Model) is a probabilistic model of the joint probability of a collection of random variables with both observations and states. The GMM (Gaussian Mixture Mo...
We present an algorithm for finding an ssparse vector x that minimizes the squareerror y - x 2 where satisfies the restricted isometry property (RIP), with isometric constant 2s ...
Compressed Sensing is a new paradigm for acquiring the compressible signals that arise in many applications. These signals can be approximated using an amount of information much ...
Anna C. Gilbert, Martin J. Strauss, Joel A. Tropp,...
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...