Sciweavers

114 search results - page 8 / 23
» Local and Global Approximations for Incomplete Data
Sort
View
JMLR
2012
13 years 2 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
NA
2008
92views more  NA 2008»
14 years 11 months ago
Computing bivariate splines in scattered data fitting and the finite-element method
A number of useful bivariate spline methods are global in nature, i.e., all of the coefficients of an approximating spline must be computed at one time. Typically this involves sol...
Larry L. Schumaker
SIAMMAX
2010
164views more  SIAMMAX 2010»
14 years 6 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu
ACIVS
2008
Springer
15 years 1 months ago
A Fast and Fully Automatic Ear Recognition Approach Based on 3D Local Surface Features
Sensitivity of global features to pose, illumination and scale variations encouraged researchers to use local features for object representation and recognition. Availability of 3D...
Syed M. S. Islam, Rowan Davies, Ajmal S. Mian, Moh...
IROS
2007
IEEE
119views Robotics» more  IROS 2007»
15 years 6 months ago
Scalable SLAM building conditionally independent local maps
— Local maps algorithms have demonstrated to be well suited for mapping large environments as can reduce the computational cost and improve the consistency of the final estimati...
Pedro Pinies, Juan D. Tardós