Sciweavers

7015 search results - page 22 / 1403
» Approximation algorithms for co-clustering
Sort
View
CVPR
2012
IEEE
11 years 10 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
2010
IEEE
12 years 5 months ago
Abrupt motion tracking via adaptive stochastic approximation Monte Carlo sampling
Robust tracking of abrupt motion is a challenging task in computer vision due to the large motion uncertainty. In this paper, we propose a stochastic approximation Monte Carlo (...
Xiuzhuang Zhou and Yao Lu
SODA
2001
ACM
150views Algorithms» more  SODA 2001»
13 years 9 months ago
A faster implementation of the Goemans-Williamson clustering algorithm
We give an implementation of the Goemans-Williamson clustering procedure which is at the core of several approximation algorithms including those for Generalized Steiner Trees, Pr...
Richard Cole, Ramesh Hariharan, Moshe Lewenstein, ...
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
13 years 11 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
JDA
2008
88views more  JDA 2008»
13 years 7 months ago
Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3
The best approximation algorithm for Max Cut in graphs of maximum degree 3 uses semidefinite programming, has approximation ratio 0.9326, and its running time is (n3.5 log n) ; bu...
Cristina Bazgan, Zsolt Tuza