740 search results - page 27 / 148 » An approximation ratio for biclustering |
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
The visual hull is widely used to produce three dimensional models from multiple views, due to the reliability of the resulting surface. This paper presents a novel method for eff...
114
click to vote
TOC
2008
15 years 1 months ago
2008
: This is a comment on the article "An O(logn) Approximation Ratio for the Asymmetric Traveling Salesman Path Problem" by C. Chekuri and M. P
118
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
110
click to vote
TC
2008
15 years 1 months ago
2008
The common belief is that localized broadcast algorithms are not able to guarantee both full delivery and a good bound on the number of transmissions. In this paper, we propose the...
TCS
2008
15 years 1 months ago
2008
We study open-shop scheduling problems with job release times. The objective is to minimize the makespan. Dense schedules, easy to construct, are often used as approximate solutio...