3894 search results - page 200 / 779 » Approximation Algorithms for Biclustering Problems |
168
click to vote
IPL
2002
15 years 6 months ago
2002
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
202
click to vote
AAECC
2007
Springer
15 years 6 months ago
2007
Springer
Abstract We describe a method to approximate a segment of the intersection curve of two implicitly defined surfaces by a rational parametric curve. Starting from an initial soluti...
176
click to vote
IPL
2002
15 years 6 months ago
2002
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
165
click to vote
CCCG
2007
15 years 8 months ago
2007
In the minimum-cost k-hop spanning tree (k-hop MST) problem, we are given a set S of n points in a metric space, a positive small integer k and a root point r ∈ S. We are intere...
176
click to vote
TCS
2008
15 years 6 months ago
2008
The problem of computing approximate GCDs of several polynomials with real or complex coefficients can be formulated as computing the minimal perturbation such that the perturbed ...