358 search results - page 10 / 72 » On the Distributed Complexity of Computing Maximal Matchings |
259
click to vote
ICDE
2009
IEEE
16 years 7 months ago
2009
IEEE
We consider the problem of efficiently computing weighted proximity best-joins over multiple lists, with applications in information retrieval and extraction. We are given a multi-...
175
click to vote
RECOMB
2004
Springer
16 years 6 months ago
2004
Springer
The challenge of similarity search in massive DNA sequence databases has inspired major changes in BLAST-style alignment tools, which accelerate search by inspecting only pairs of...
155
click to vote
MIDDLEWARE
2005
Springer
15 years 11 months ago
2005
Springer
The content-based publish/subscribe model has been adopted by many services to deliver data between distributed users based on application-specific semantics. Two key issues in su...
147
click to vote
IPPS
1999
IEEE
15 years 10 months ago
1999
IEEE
We present a coarse grained parallel algorithm for computing a maximum matching in a convex bipartite graph G = A;B;E. For p processors with N=p memory per processor, N = jAj+jBj,...
140
click to vote
ICPR
2006
IEEE
16 years 7 months ago
2006
IEEE
Skeletal representations of 2-D shape, including shock graphs, have become increasingly popular for shape matching and object recognition. However, it is well known that skeletal ...