740 search results - page 33 / 148 » An approximation ratio for biclustering |
151
click to vote
PROPERTYTESTING
2010
14 years 11 months ago
2010
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
116
click to vote
ICIP
1999
IEEE
16 years 3 months ago
1999
IEEE
This paper presents an iterative algorithm for approximating gray-scale images with adaptive triangular meshes ensuring a given tolerance. At each iteration, the algorithm applies...
147
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
106
click to vote
ICASSP
2007
IEEE
15 years 8 months ago
2007
IEEE
In this paper, we propose a coding algorithm for raw images with high dynamic ranges. Our encoder has two layers. In the first layer, 24 bit low dynamic range image is encoded by...
128
click to vote
APPROX
2009
Springer
15 years 8 months ago
2009
Springer
The (undirected) Node Connectivity Augmentation (NCA) problem is: given a graph J = (V, EJ ) and connectivity requirements {r(u, v) : u, v ∈ V }, find a minimum size set I of n...