238 search results - page 12 / 48 » Parallel Algorithm for Maximum Weight Matching in Trees |
105
click to vote
KDD
2012
ACM
13 years 1 days ago
2012
ACM
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
ESA
2008
Springer
14 years 11 months ago
2008
Springer
The edge asymmetry of a directed, edge-weighted graph is defined as the maximum ratio of the weight of antiparallel edges in the graph, and can be used as a measure of the heterog...
DAM
2006
14 years 9 months ago
2006
Abstract. Computing a maximum weighted stable set in a bipartite graph is considered wellsolved and usually approached with preflow-push, Ford-Fulkerson or network simplex algorith...
ISPAN
1997
IEEE
15 years 1 months ago
1997
IEEE
Abstract- String matching problem received much attention over the years due to its importance in various applications such as text/file comparison, DNA sequencing, search engines,...
ISITA
2010
14 years 7 months ago
2010
Abstract--Chow and Liu considered the problem of approximating discrete joint distributions with dependence tree distributions where the goodness of the approximations were measure...