Sciweavers

495 search results - page 52 / 99
» Sparse representation algorithms based on mean-field approxi...
Sort
View
STOC
2002
ACM
177views Algorithms» more  STOC 2002»
15 years 10 months ago
Similarity estimation techniques from rounding algorithms
A locality sensitive hashing scheme is a distribution on a family F of hash functions operating on a collection of objects, such that for two objects x, y, PrhF [h(x) = h(y)] = si...
Moses Charikar
149
Voted
PODS
2009
ACM
100views Database» more  PODS 2009»
15 years 10 months ago
Space-optimal heavy hitters with strong error bounds
The problem of finding heavy hitters and approximating the frequencies of items is at the heart of many problems in data stream analysis. It has been observed that several propose...
Radu Berinde, Graham Cormode, Piotr Indyk, Martin ...
SMI
2006
IEEE
135views Image Analysis» more  SMI 2006»
15 years 4 months ago
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
One of the challenges in geometry processing is to automatically reconstruct a higher-level representation from raw geometric data. For instance, computing a parameterization of a...
Bruno Lévy
155
Voted
CVPR
2012
IEEE
13 years 18 days ago
Finite Element based sequential Bayesian Non-Rigid Structure from Motion
Navier’s equations modelling linear elastic solid deformations are embedded within an Extended Kalman Filter (EKF) to compute a sequential Bayesian estimate for the Non-Rigid St...
Antonio Agudo, Begoña Calvo, J. M. M. Monti...
PKDD
2009
Springer
88views Data Mining» more  PKDD 2009»
15 years 4 months ago
Feature Weighting Using Margin and Radius Based Error Bound Optimization in SVMs
The Support Vector Machine error bound is a function of the margin and radius. Standard SVM algorithms maximize the margin within a given feature space, therefore the radius is fi...
Huyen Do, Alexandros Kalousis, Melanie Hilario