398 search results - page 37 / 80 » Ant Algorithm for the Graph Matching Problem |
STACS
1992
Springer
13 years 11 months ago
1992
Springer
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
AAIM
2007
Springer
14 years 1 months ago
2007
Springer
Given an undirected graph G = (V, E) and a weight function w : E → Z+ , we consider the problem of orienting all edges in E so that the maximum weighted outdegree among all verti...
DC
2011
12 years 7 months ago
2011
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
ICDM
2005
IEEE
14 years 1 months ago
2005
IEEE
We consider the problem of elastic matching of time series. We propose an algorithm that determines a subsequence of a target time series that best matches a query series. In the ...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
Object detection is challenging partly due to the limited discriminative power of local feature descriptors. We amend this limitation by incorporating spatial constraints among ne...