Sciweavers

3875 search results - page 233 / 775
» Approximation algorithms for the 0-extension problem
Sort
View
178
Voted
ISSAC
2007
Springer
153views Mathematics» more  ISSAC 2007»
16 years 11 days ago
On exact and approximate interpolation of sparse rational functions
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
Erich Kaltofen, Zhengfeng Yang
CORR
2010
Springer
128views Education» more  CORR 2010»
15 years 6 months ago
Sublinear Optimization for Machine Learning
Abstract--We give sublinear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclos...
Kenneth L. Clarkson, Elad Hazan, David P. Woodruff
INFORMATICALT
2010
88views more  INFORMATICALT 2010»
15 years 4 months ago
Inapproximability Results for Wavelength Assignment in WDM Optical Networks
We address the issue of inapproximability of the wavelength assignment problem in wavelength division multiplexing (WDM) optical networks. We prove that in an n-node WDM optical ne...
Keqin Li
155
Voted
COCOON
2010
Springer
15 years 11 months ago
Clustering with or without the Approximation
We study algorithms for clustering data that were recently proposed by Balcan, Blum and Gupta in SODA’09 [4] and that have already given rise to two follow-up papers. The input f...
Frans Schalekamp, Michael Yu, Anke van Zuylen
132
Voted
STOC
2004
ACM
76views Algorithms» more  STOC 2004»
16 years 6 months ago
Isotopic implicit surface meshing
This paper addresses the problem of piecewise linear approximation of implicit surfaces. We first give a criterion ensuring that the zero-set of a smooth function and the one of a...
Jean-Daniel Boissonnat, David Cohen-Steiner, Gert ...