7930 search results - page 315 / 1586 » Greedy in Approximation Algorithms |
180
click to vote
ALGORITHMICA
2005
15 years 6 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
223
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
205
click to vote
ISBI
2004
IEEE
16 years 7 months ago
2004
IEEE
We present a new fast implementation of a non-rigid registration algorithm, based on a finite element elastic deformation model using the mutual information metric with a linear e...
182
click to vote
ADHOCNOW
2008
Springer
16 years 1 months ago
2008
Springer
We present 1 − approximation algorithms for the maximum matching problem in location aware unit disc graphs and in growth-bounded graphs. The algorithm for unit disk graph is loc...
162
click to vote
DIALM
2008
ACM
15 years 8 months ago
2008
ACM
We consider the Maximum Integral Flow with Energy Constraints problem: given a directed graph G = (V, E) with edge-weights {w(e) : e E} and node battery capacities {b(v) : v V }...