5595 search results - page 124 / 1119 » Approximation Algorithms for Clustering Problems |
126
Voted
ICCSA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
144
click to vote
MICAI
2007
Springer
15 years 11 months ago
2007
Springer
Among various document clustering algorithms that have been proposed so far, the most useful are those that automatically reveal the number of clusters and assign each target docum...
176
click to vote
COMBINATORICA
2010
14 years 11 months ago
2010
We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
144
click to vote
TKDE
2008
15 years 4 months ago
2008
Clustering is inherently a difficult task and is made even more difficult when the selection of relevant features is also an issue. In this paper, we propose an approach for simult...
154
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
In the longest common subsequence problem the task is to find the longest sequence of letters that can be found as subsequence in all members of a given finite set of sequences....