3874 search results - page 106 / 775 » Approximation Algorithms for k-hurdle Problems |
PR
1998
14 years 9 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...
STOC
2002
ACM
15 years 10 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 ...
DFG
2009
Springer
15 years 4 months 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...
203
click to vote
INFOCOM
2012
IEEE
13 years 10 days ago
2012
IEEE
—When a large amount of sensors are randomly deployed into a field, how can we make a sleep/activate schedule for sensors to maximize the lifetime of target coverage in the fie...
ECCV
2008
Springer
15 years 11 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...