3894 search results - page 360 / 779 » Approximation Algorithms for Biclustering Problems |
163
click to vote
IVC
2007
15 years 6 months ago
2007
We consider simple cube-curves in the orthogonal 3D grid of cells. The union of all cells contained in such a curve (also called the tube of this curve) is a polyhedrally bounded s...
177
click to vote
SIAMSC
2010
15 years 4 months ago
2010
In this paper, we develop a fast multilevel algorithm for simultaneously denoising and deblurring images under the total variation regularization. Although much effort has been de...
169
click to vote
ICASSP
2011
IEEE
14 years 9 months ago
2011
IEEE
Alternating optimization algorithms for canonical polyadic decomposition (with/without nonnegative constraints) often accompany update rules with low computational cost, but could...
161
click to vote
STOC
2003
ACM
16 years 6 months ago
2003
ACM
Given an undirected graph or an Eulerian directed graph G and a subset S of its vertices, we show how to determine the edge connectivity C of the vertices in S in time O(C3 n log ...
186
click to vote
EMO
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. The hypervolume measure is one of the most frequently applied measures for comparing the results of evolutionary multiobjective optimization algorithms (EMOA). The idea t...