7015 search results - page 201 / 1403 » Approximation algorithms for co-clustering |
176
click to vote
FOCS
2004
IEEE
15 years 10 months ago
2004
IEEE
Edit distance has been extensively studied for the past several years. Nevertheless, no linear-time algorithm is known to compute the edit distance between two strings, or even to...
179
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...
203
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...
180
click to vote
ADHOCNOW
2008
Springer
16 years 25 days 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...
158
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 }...