Sciweavers

215 search results - page 13 / 43
» Sums of squares based approximation algorithms for MAX-SAT
Sort
View
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
13 years 8 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
MICS
2007
128views more  MICS 2007»
13 years 7 months ago
Structured Low Rank Approximation of a Bezout Matrix
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
Dongxia Sun, Lihong Zhi
IJCV
2006
142views more  IJCV 2006»
13 years 7 months ago
Geometry and Convergence Analysis of Algorithms for Registration of 3D Shapes
The computation of a rigid body transformation which optimally aligns a set of measurement points with a surface and related registration problems are studied from the viewpoint o...
Helmut Pottmann, Qi-Xing Huang, Yong-Liang Yang, S...
DATAMINE
2006
127views more  DATAMINE 2006»
13 years 7 months ago
Computing LTS Regression for Large Data Sets
Least trimmed squares (LTS) regression is based on the subset of h cases (out of n) whose least squares t possesses the smallest sum of squared residuals. The coverage h may be se...
Peter Rousseeuw, Katrien van Driessen
TOG
2002
212views more  TOG 2002»
13 years 7 months ago
Least squares conformal maps for automatic texture atlas generation
A Texture Atlas is an efficient color representation for 3D Paint Systems. The model to be textured is decomposed into charts homeomorphic to discs, each chart is parameterized, a...
Bruno Lévy, Sylvain Petitjean, Nicolas Ray,...