Sciweavers

455 search results - page 35 / 91
» A local approximation algorithm for maximum weight matching
Sort
View
CVPR
2007
IEEE
15 years 11 months ago
Pyramid Match Hashing: Sub-Linear Time Indexing Over Partial Correspondences
Matching local features across images is often useful when comparing or recognizing objects or scenes, and efficient techniques for obtaining image-to-image correspondences have b...
Kristen Grauman, Trevor Darrell
90
Voted
TIP
2010
128views more  TIP 2010»
14 years 8 months ago
Variational Bayesian Image Restoration With a Product of Spatially Weighted Total Variation Image Priors
—In this paper a new image prior is introduced and used in image restoration. This prior is based on products of spatially weighted Total Variations (TV). These spatial weights p...
Giannis K. Chantas, Nikolas P. Galatsanos, Rafael ...
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
14 years 9 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram
ML
2002
ACM
146views Machine Learning» more  ML 2002»
14 years 9 months ago
Kernel Matching Pursuit
Matching Pursuit algorithms learn a function that is a weighted sum of basis functions, by sequentially appending functions to an initially empty basis, to approximate a target fu...
Pascal Vincent, Yoshua Bengio
87
Voted
SGP
2003
14 years 11 months ago
Approximating and Intersecting Surfaces from Points
Point sets become an increasingly popular shape representation. Most shape processing and rendering tasks require the approximation of a continuous surface from the point data. We...
Anders Adamson, Marc Alexa