1469 search results - page 109 / 294 » Approximate polynomial decomposition |
ICIP
2002
IEEE
15 years 11 months ago
2002
IEEE
The approximation of surfaces to scattered data is an important problem encountered in a variety of scientific applications, such as reverse engineering, computer vision, computer...
104
click to vote
WADS
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. The buy-at-bulk network design problem has been extensively studied in the general graph model. In this paper we consider the geometric version of the problem, where all ...
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
We give near-optimal sketching and streaming algorithms for estimating Shannon entropy in the most general streaming model, with arbitrary insertions and deletions. This improves ...
101
click to vote
APPROX
2007
Springer
15 years 4 months ago
2007
Springer
We investigate the problem of computing a minimum set of solutions that approximates within a specified accuracy the Pareto curve of a multiobjective optimization problem. We show...
ISAAC
2005
Springer
15 years 3 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...