3894 search results - page 138 / 779 » Approximation Algorithms for Biclustering Problems |
159
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
Given a set H of n hyperplanes in IRd , we present an algorithm that ε-approximates the extent between the top and bottom k levels of the arrangement of H in time O(n+(k/ε)c), w...
158
click to vote
WADS
2005
Springer
15 years 12 months ago
2005
Springer
We analyze the performance of simple algorithms for matching two planar point sets under rigid transformations so as to minimize the directed Hausdorff distance between the sets....
176
click to vote
COMPGEOM
2007
ACM
15 years 10 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
169
click to vote
CP
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We present a parameterized approximation scheme for distributed combinatorial optimization problems based on dynamic programming. The algorithm is a utility propagation m...
164
click to vote
APPROX
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. We consider the problem of fitting an n × n distance matrix M by a tree metric T. We give a factor O(min{n1/p , (k log n)1/p }) approximation algorithm for finding the...