Sciweavers

1536 search results - page 64 / 308
» Approximately Dominating Representatives
Sort
View
CVPR
2010
IEEE
14 years 10 months ago
Efficient computation of robust low-rank matrix approximations in the presence of missing data using the L1 norm
The calculation of a low-rank approximation of a matrix is a fundamental operation in many computer vision applications. The workhorse of this class of problems has long been the ...
Anders Eriksson, Anton van den Hengel
INFOCOM
2012
IEEE
13 years 2 months ago
Approximately optimal adaptive learning in opportunistic spectrum access
—In this paper we develop an adaptive learning algorithm which is approximately optimal for an opportunistic spectrum access (OSA) problem with polynomial complexity. In this OSA...
Cem Tekin, Mingyan Liu
CVPR
2012
IEEE
13 years 2 months ago
Curvature-based regularization for surface approximation
We propose an energy-based framework for approximating surfaces from a cloud of point measurements corrupted by noise and outliers. Our energy assigns a tangent plane to each (noi...
Carl Olsson, Yuri Boykov
CVPR
2004
IEEE
16 years 1 months ago
Fast Contour Matching Using Approximate Earth Mover's Distance
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
Kristen Grauman, Trevor Darrell
ICIP
2005
IEEE
16 years 1 months ago
Greedy non-linear approximation of the plenoptic function for interactive transmission of 3D scenes
We consider an interactive browsing environment, with greedy optimization of a current view, conditioned on the availability of previously transmitted information for other (possi...
Pietro Zanuttigh, Nicola Brusco, David Taubman, Gu...