Sciweavers

47 search results - page 3 / 10
» Adaptive Sampling and Fast Low-Rank Matrix Approximation
Sort
View
ICRA
1995
IEEE
188views Robotics» more  ICRA 1995»
13 years 9 months ago
Fast Approximation of Range Images by Triangular Meshes Generated through Adaptive Randomized Sampling
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
Miguel Angel García
SIAMJO
2010
246views more  SIAMJO 2010»
13 years 3 months ago
A Singular Value Thresholding Algorithm for Matrix Completion
This paper introduces a novel algorithm to approximate the matrix with minimum nuclear norm among all matrices obeying a set of convex constraints. This problem may be understood a...
Jian-Feng Cai, Emmanuel J. Candès, Zuowei S...
GD
2006
Springer
13 years 9 months ago
SSDE: Fast Graph Drawing Using Sampled Spectral Distance Embedding
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
Ali Civril, Malik Magdon-Ismail, Eli Bocek-Rivele
STOC
2006
ACM
122views Algorithms» more  STOC 2006»
14 years 5 months ago
Fast convergence to Wardrop equilibria by adaptive sampling methods
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...
Simon Fischer, Harald Räcke, Berthold Vö...
PODS
2000
ACM
146views Database» more  PODS 2000»
13 years 9 months ago
Analysis and Application of Adaptive Sampling
An estimation algorithm for a query is a probabilistic algorithm that computes an approximation for the size (number of tuples) of the query. One class of estimation algorithms us...
James F. Lynch