2137 search results - page 238 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
179
Voted
MICAI
2007
Springer
16 years 15 days 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...
151
click to vote
IJAC
2007
15 years 6 months ago
2007
The Whitehead minimization problem consists in finding a minimum size element in the automorphic orbit of a word, a cyclic word or a finitely generated subgroup in a finite rank...
167
Voted
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
The problem of choosing fast implementations for a class of recursive algorithms such as the fast Fourier transforms can be formulated as an optimization problem over the language...
145
click to vote
FSTTCS
2006
Springer
15 years 10 months ago
2006
Springer
We consider the problem of approximating normal and feature sizes of a surface from point cloud data that may be noisy. These problems are central to many applications dealing wit...
157
click to vote
ESA
2007
Springer
16 years 16 days ago
2007
Springer
Given a graph G = (V, E), a (d, k)-coloring is a function from the vertices V to colors {1, 2, . . . , k} such that any two vertices within distance d of each other are assigned di...