Sciweavers

249 search results - page 4 / 50
» Finding Patterns in Given Intervals
Sort
View
COCOON
2006
Springer
14 years 3 days ago
Finding Patterns with Variable Length Gaps or Don't Cares
In this paper we have presented new algorithms to handle the pattern matching problem where the pattern can contain variable length gaps. Given a pattern P with variable length gap...
M. Sohel Rahman, Costas S. Iliopoulos, Inbok Lee, ...
WAIM
2009
Springer
14 years 3 months ago
Finding Irredundant Contained Rewritings of Tree Pattern Queries Using Views
Contained rewriting and maximal contained rewriting of tree pattern queries using views have been studied recently for the class of tree patterns involving /, //, and []. Given que...
Junhu Wang, Kewen Wang, Jiuyong Li
IPPS
2007
IEEE
14 years 2 months ago
A Multi-Level Parallel Implementation of a Program for Finding Frequent Patterns in a Large Sparse Graph
Graphs capture the essential elements of many problems broadly defined as searching or categorizing. With the rapid increase of data volumes from sensors, many application discipl...
Steve Reinhardt, George Karypis
DIS
2000
Springer
14 years 22 days ago
A Practical Algorithm to Find the Best Subsequence Patterns
Given two sets of strings, consider the problem to find a subsequence that is common to one set but never appears in the other set. The problem is known to be NP-complete. We gene...
Masahiro Hirao, Hiromasa Hoshino, Ayumi Shinohara,...
ACL
2003
13 years 9 months ago
Finding Non-local Dependencies: Beyond Pattern Matching
We describe an algorithm for recovering non-local dependencies in syntactic dependency structures. The patternmatching approach proposed by Johnson (2002) for a similar task for p...
Valentin Jijkoun