740 search results - page 38 / 148 » An approximation ratio for biclustering |
152
click to vote
TIP
2002
15 years 1 months ago
2002
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
228
click to vote
WADS
2009
Springer
15 years 8 months ago
2009
Springer
In this paper, we study the two-dimensional geometrical bin packing problem (2DBP): given a list of rectangles, provide a packing of all these into the smallest possible number of ...
111
click to vote
SODA
2004
ACM
15 years 3 months ago
2004
ACM
Given an undirected graph, finding either a minimum 2-edge-connected spanning subgraph or a minimum 2vertex-connected (biconnected) spanning subgraph is MaxSNP-hard. We show that ...
IJCNN
2007
IEEE
15 years 8 months ago
2007
IEEE
— In this article, we apply the competitive associative net called CAN2 to the processing of the range data of indoor environment acquired by a mobile robot, where the CAN2 is a ...
104
click to vote
WADS
2007
Springer
15 years 8 months ago
2007
Springer
In this paper, we give a O(log copt)-approximation algorithm for the point guard problem where copt is the optimal number of guards. Our algorithm runs in time polynomial in n, the...