Results 1  10
of
837
On the Linear Number of Matching Substrings
"... Abstract: We study the number of matching substrings in the pattern matching problem. In general, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction enables to find at most a linear number of matching substrings. We first explore two well ..."
Abstract
 Add to MetaCart
wellknown linearizing restriction rules, the longestmatch rule and the shortestmatch substring search rule, and show that both rules give the same result when a pattern is an infixfree set even though they have different semantics. Then, we introduce a new linearizing restriction, the leftmost nonoverlapping
HYBRID APPROACH FOR GENERATING NON OVERLAPPED SUBSTRING USING GENETIC ALGORITHM
"... Approximate Membership Localization (AML) is the process that provides user with most relevant matched substrings. In a document, one word position belongs to only one reference matched substring. There should not be any overlap in a true matched substring. In the Approximate Membership Extraction ( ..."
Abstract
 Add to MetaCart
Approximate Membership Localization (AML) is the process that provides user with most relevant matched substrings. In a document, one word position belongs to only one reference matched substring. There should not be any overlap in a true matched substring. In the Approximate Membership Extraction
Range NonOverlapping Indexing
, 909
"... Abstract. We study the nonoverlapping indexing problem: Given a text T, preprocess it in order to answer queries of the form: given a pattern P, report the maximal set of nonoverlapping occurrences of P in T. A generalization of this problem is the range nonoverlapping indexing where in addition ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Abstract. We study the nonoverlapping indexing problem: Given a text T, preprocess it in order to answer queries of the form: given a pattern P, report the maximal set of nonoverlapping occurrences of P in T. A generalization of this problem is the range nonoverlapping indexing where in addition
Polygraph: Automatically generating signatures for polymorphic worms
 In Proceedings of the IEEE Symposium on Security and Privacy
, 2005
"... It is widely believed that contentsignaturebased intrusion detection systems (IDSes) are easily evaded by polymorphic worms, which vary their payload on every infection attempt. In this paper, we present Polygraph, a signature generation system that successfully produces signatures that match poly ..."
Abstract

Cited by 275 (17 self)
 Add to MetaCart
It is widely believed that contentsignaturebased intrusion detection systems (IDSes) are easily evaded by polymorphic worms, which vary their payload on every infection attempt. In this paper, we present Polygraph, a signature generation system that successfully produces signatures that match
Substring Matching for Clone Detection and Change Tracking
, 1994
"... Legacy systems pose problems to maintainers that can be solved partially with effective tools. A prototype tool for determining collections of files sharing a large amount of text has been developed and applied to a 40 megabyte source tree containing two releases of the gcc compiler. Similarities in ..."
Abstract

Cited by 74 (3 self)
 Add to MetaCart
Legacy systems pose problems to maintainers that can be solved partially with effective tools. A prototype tool for determining collections of files sharing a large amount of text has been developed and applied to a 40 megabyte source tree containing two releases of the gcc compiler. Similarities in source code and documentation corresponding to software cloning, movement and inertia between releases, as well as the effects of preprocessing easily stand out in a way that immediately conveys nonobvious structural information to a maintainer taking responsibility for such a system.
Range nonoverlapping indexing and successive list indexing
 of Lecture Notes in Computer Science
, 2007
"... We present two natural variants of the indexing problem: In the range nonoverlapping indexing problem, we preprocess a given text to answer queries in which we are given a pattern, and wish to find a maximallength sequence of occurrences of the pattern in the text, such that the occurrences do not ..."
Abstract

Cited by 9 (2 self)
 Add to MetaCart
We present two natural variants of the indexing problem: In the range nonoverlapping indexing problem, we preprocess a given text to answer queries in which we are given a pattern, and wish to find a maximallength sequence of occurrences of the pattern in the text, such that the occurrences do
Vehicle identification between nonoverlapping cameras without direct feature matching
 In ICCV
, 2005
"... We propose a novel method for identifying road vehicles between two nonoverlapping cameras. The problem is formulated as a samedifferent classification problem: probability of two vehicle images from two distinct cameras being from the same vehicle or from different vehicles. The key idea is to co ..."
Abstract

Cited by 20 (1 self)
 Add to MetaCart
We propose a novel method for identifying road vehicles between two nonoverlapping cameras. The problem is formulated as a samedifferent classification problem: probability of two vehicle images from two distinct cameras being from the same vehicle or from different vehicles. The key idea
Fast Similarity Search in the Presence of Noise, Scaling, and Translation in TimeSeries Databases
 In VLDB
, 1995
"... We introduce a new model of similarity of time sequences that captures the intuitive notion that two sequences should be considered similar if they have enough nonoverlapping timeordered pairs of subsequences thar are similar. The model allows the amplitude of one of the two sequences to be scaled ..."
Abstract

Cited by 236 (6 self)
 Add to MetaCart
We introduce a new model of similarity of time sequences that captures the intuitive notion that two sequences should be considered similar if they have enough nonoverlapping timeordered pairs of subsequences thar are similar. The model allows the amplitude of one of the two sequences
An Algorithm For Locating NonOverlapping Regions Of Maximum Alignment Score
 SIAM J. Comput
, 1993
"... . In this paper we present an O(N 2 log 2 N) algorithm for finding the two nonoverlapping substrings of a given string of length N which have the highestscoring alignment between them. This significantly improves the previously best known bound of O(N 3 ) for the worstcase complexity of thi ..."
Abstract

Cited by 29 (2 self)
 Add to MetaCart
. In this paper we present an O(N 2 log 2 N) algorithm for finding the two nonoverlapping substrings of a given string of length N which have the highestscoring alignment between them. This significantly improves the previously best known bound of O(N 3 ) for the worstcase complexity
Results 1  10
of
837