3894 search results - page 172 / 779 » Approximation Algorithms for Biclustering Problems |
173
click to vote
CPM
2008
Springer
15 years 8 months ago
2008
Springer
We introduce a new dimension to the widely studied on-line approximate string matching problem, by introducing an error threshold parameter so that the algorithm is allowed to mis...
189
click to vote
WAOA
2007
Springer
16 years 18 days ago
2007
Springer
For a connected graph G, let L(G) denote the maximum number of leaves in a spanning tree in G. The problem of computing L(G) is known to be NP-hard even for cubic graphs. We improv...
186
click to vote
WG
2007
Springer
16 years 17 days ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
162
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
A new efficient MRF optimization algorithm, called FastPD, is proposed, which generalizes -expansion. One of its main advantages is that it offers a substantial speedup over that ...
180
click to vote
ESA
2005
Springer
16 years 10 hour ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...