Sciweavers

811 search results - page 5 / 163
» Avoiding Approximate Squares
Sort
View
SODA
2003
ACM
121views Algorithms» more  SODA 2003»
15 years 1 months ago
An improved approximation algorithm for the partial latin square extension problem
Previous work on the partial Latin square extension (PLSE) problem resulted in a 2-approximation algorithm based on the LP relaxation of a three-dimensional assignment IP formulat...
Carla P. Gomes, Rommel G. Regis, David B. Shmoys
PRL
2011
14 years 6 months ago
Efficient approximate Regularized Least Squares by Toeplitz matrix
Machine Learning based on the Regularized Least Square (RLS) model requires one to solve a system of linear equations. Direct-solution methods exhibit predictable complexity and s...
Sergio Decherchi, Paolo Gastaldo, Rodolfo Zunino
SADM
2008
178views more  SADM 2008»
14 years 11 months ago
Fast Projection-Based Methods for the Least Squares Nonnegative Matrix Approximation Problem
: Nonnegative matrix approximation (NNMA) is a popular matrix decomposition technique that has proven to be useful across a diverse variety of fields with applications ranging from...
Dongmin Kim, Suvrit Sra, Inderjit S. Dhillon
SIBGRAPI
2003
IEEE
15 years 5 months ago
Moving Least Squares Multiresolution Surface Approximation
We describe a new method for surface reconstruction based on unorganized point clouds without normals. We also present a new algorithm for refining the inital triangulation. The o...
Boris Mederos, Luiz Velho, Luiz Henrique de Figuei...
GMP
2006
IEEE
131views Solid Modeling» more  GMP 2006»
15 years 5 months ago
Least-Squares Approximation by Pythagorean Hodograph Spline Curves Via an Evolution Process
The problem of approximating a given set of data points by splines composed of Pythagorean Hodograph (PH) curves is addressed. In order to solve this highly non-linear problem, we ...
Martin Aigner, Zbynek Sír, Bert Jüttle...