Sciweavers

591 search results - page 23 / 119
» Implementing Joins Using Extensible Pattern Matching
Sort
View
88
Voted
RSA
2002
73views more  RSA 2002»
14 years 9 months ago
New and faster filters for multiple approximate string matching
We present three new algorithms for on-line multiple string matching allowing errors. These are extensions of previous algorithms that search for a single pattern. The average run...
Ricardo A. Baeza-Yates, Gonzalo Navarro
WWW
2008
ACM
15 years 10 months ago
SPARQL basic graph pattern optimization using selectivity estimation
In this paper, we formalize the problem of Basic Graph Pattern (BGP) optimization for SPARQL queries and main memory graph implementations of RDF data. We define and analyze the c...
Markus Stocker, Andy Seaborne, Abraham Bernstein, ...
ICSM
2003
IEEE
15 years 2 months ago
On Modeling Software Architecture Recovery as Graph Matching
This paper presents a graph matching model for the software architecture recovery problem. Because of their expressiveness, the graphs have been widely used for representing both ...
Kamran Sartipi, Kostas Kontogiannis
ANLP
1994
109views more  ANLP 1994»
14 years 11 months ago
Symmetric Pattern Matching Analysis for English Coordinate Structures
The authors propose a model for analyzing English sentences including coordinate conjunctions such as "and","or","but" and the equivalent words. Synt...
Akitoshi Okumura, Kazunori Muraki
ANCS
2005
ACM
15 years 3 months ago
Fast and scalable pattern matching for content filtering
High-speed packet content inspection and filtering devices rely on a fast multi-pattern matching algorithm which is used to detect predefined keywords or signatures in the packe...
Sarang Dharmapurikar, John W. Lockwood