3894 search results - page 51 / 779 » Approximation Algorithms for Biclustering Problems |
152
click to vote
SOFSEM
2009
Springer
16 years 2 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
151
click to vote
AAIM
2010
Springer
15 years 9 months ago
2010
Springer
Abstract. This paper considers a generalization of the capacitated spanning tree, in which some of the nodes have capacity K, and the others have capacity k < K. We prove that t...
246
click to vote
ICDE
2012
IEEE
13 years 8 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
261
click to vote
APPROX
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. In this paper we introduce a new technique for approximation schemes for geometrical optimization problems. As an example problem, we consider the following variant of th...
163
click to vote
GBRPR
2005
Springer
15 years 11 months ago
2005
Springer
This work discusses the issue of approximation in point set matching problems. In general, one may have two classes of approximations when tackling a matching problem: a representa...