3894 search results - page 114 / 779 » Approximation Algorithms for Biclustering Problems |
164
click to vote
PR
1998
15 years 6 months ago
1998
This paper describes a method for optimizing the cost matrix of any approximate string matching algorithm based on the Levenshtein distance. The method, which uses genetic algorit...
148
click to vote
STOC
2002
ACM
16 years 6 months ago
2002
ACM
: We initiate the study of a new measure of approximation. This measure compares the performance of an approximation algorithm to the random assignment algorithm. This is a useful ...
165
click to vote
DFG
2009
Springer
16 years 29 days ago
2009
Springer
In this chapter we present recent contributions in the field of sequential job scheduling on network machines which work in parallel; these are subject to temporary unavailability...
167
click to vote
ECCV
2008
Springer
16 years 8 months ago
2008
Springer
Abstract. This paper describes a novel approach to recovering a parametric deformation that optimally registers one image to another. The method proceeds by constructing a global c...
189
click to vote
STOC
1998
ACM
15 years 10 months ago
1998
ACM
We present a deterministic strongly polynomial algorithm that computes the permanent of a nonnegative n × n matrix to within a multiplicative factor of en. To this end we develop...