Sciweavers

17760 search results - page 266 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
ECCV
2008
Springer
16 years 8 months ago
What Is a Good Nearest Neighbors Algorithm for Finding Similar Patches in Images?
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...
Neeraj Kumar, Li Zhang, Shree K. Nayar
ICIP
2001
IEEE
16 years 8 months ago
EM algorithms of Gaussian mixture model and hidden Markov model
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...
Guorong Xuan, Wei Zhang, Peiqi Chai
ICML
2009
IEEE
16 years 7 months ago
Gradient descent with sparsification: an iterative algorithm for sparse recovery with restricted isometry property
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 ...
Rahul Garg, Rohit Khandekar
STOC
2007
ACM
106views Algorithms» more  STOC 2007»
16 years 7 months ago
One sketch for all: fast algorithms for compressed sensing
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,...
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
16 years 4 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor