Scaled matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary integral scale, appears. Scaled matching is an important problem that was...
详细信息
Scaled matching refers to the problem of finding all locations in the text where the pattern, proportionally enlarged according to an arbitrary integral scale, appears. Scaled matching is an important problem that was originally inspired by problems in Vision. However, in real life, a more natural model of scaled matching is the real scaled matching model. Real scaled matching is an extended version of the scaled matching problem allowing arbitrary real-sized scales, approximated by some function, e.g., truncation. It has been shown that the scaled matching problem can be solved in linear time. However, even though there has been follow-up work on the problem, it remained an open question whether real scaled matching could be solved faster than the simple solution of O(nm) time, where n is the text size and m is the pattern size. Using a new approach we show how to solve the real scaled matching problem in linear time. (C) 1999 Elsevier Science B.V. All rights reserved.
We design a primal-dural heuristic for the submodular set cover problem and analyze its performance giving an approximation bound as a generalization of the one for the set cover problem. As an application, a capacita...
详细信息
We design a primal-dural heuristic for the submodular set cover problem and analyze its performance giving an approximation bound as a generalization of the one for the set cover problem. As an application, a capacitated version of the partial vertex cover problem on hypergraphs with edge size at most d is considered. It will be shown that the problem can be approximated in polynomial time within a factor of d of the optimum, generalizing some existing results. (C) 1999 Elsevier Science B.V. All rights reserved.
In this paper, we propose an algorithm of O(Absolute value of V min{k, Absolute value of V, square-root Absolute value of A} Absolute value of A time complexity for finding all k-edge-connected components of a given d...
详细信息
In this paper, we propose an algorithm of O(Absolute value of V min{k, Absolute value of V, square-root Absolute value of A} Absolute value of A time complexity for finding all k-edge-connected components of a given digraph D = ( V, A) and a positive integer k. When D is symmetric, incorporating a preprocessing reduces this time complexity to 0 ( Absolute value of A + Absolute value of V2 + Absolute value of V min{k, Absolute value of V} min{k Absolute value of V, Absolute value of A}), which is at most O(Absolute value of A + k2 Absolute value of V2).
In this paper, sequential and parallel algorithms are presented to find a maximum independent set with largest weight in a weighted permutation graph. The sequential algorithm, which is designed based on dynamic progr...
详细信息
In this paper, sequential and parallel algorithms are presented to find a maximum independent set with largest weight in a weighted permutation graph. The sequential algorithm, which is designed based on dynamic programming, runs in time O(nlog n) and requires O(n) space. The parallel algorithm runs in O(log2 n) time using O(n3/log n) processors on the CREW PRAM, or O(log n) time using O(n3) processors on the CRCW PRAM.
暂无评论