7930 search results - page 130 / 1586 » Greedy in Approximation Algorithms |
180
click to vote
ISAAC
2005
Springer
15 years 12 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...
134
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
In this paper, a digital planar curve approximation method based on a multi-objective genetic algorithm is proposed. In this method, the optimization/exploration algorithm locates...
169
click to vote
COLING
2010
15 years 1 months ago
2010
This paper presents a simple and efficient algorithm for approximate dictionary matching designed for similarity measures such as cosine, Dice, Jaccard, and overlap coefficients. ...
205
click to vote
AAIM
2007
Springer
16 years 16 days ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
183
click to vote
TSP
2008
15 years 6 months ago
2008
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...