2754 search results - page 33 / 551 » Distributed Weighted Matching |
85
Voted
IJAIT
2002
15 years 15 days ago
2002
The WEBSOM methodology for building very large text archives has a very slow method for extracting meaningful unit labels. This is because the method computes for the relative fre...
CCGRID
2006
IEEE
15 years 6 months ago
2006
IEEE
Abstract— An efficient, accurate and distributed metadataoriented prefetching scheme is critical to the overall performance in large distributed storage systems. In this paper, ...
120
Voted
EMMCVPR
2001
Springer
15 years 5 months ago
2001
Springer
The interest of graph matching techniques in the pattern recognition field is increasing due to the versatility of representing knowledge in the form of graphs. However, the size ...
138
Voted
CVPR
2004
IEEE
16 years 2 months ago
2004
IEEE
Weighted graph matching is a good way to align a pair of shapes represented by a set of descriptive local features; the set of correspondences produced by the minimum cost matchin...
90
Voted
ESA
2004
Springer
15 years 6 months ago
2004
Springer
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...