Sciweavers

1700 search results - page 111 / 340
» Combinatorial Pattern Matching
Sort
View
RELMICS
2000
Springer
14 years 1 months ago
A Relational View of Subgraph Isomorphism
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, ...
Jordi Cortadella, Gabriel Valiente
IJCNLP
2005
Springer
14 years 3 months ago
Exploring Syntactic Relation Patterns for Question Answering
Abstract. In this paper, we explore the syntactic relation patterns for opendomain factoid question answering. We propose a pattern extraction method to extract the various relatio...
Dan Shen, Geert-Jan M. Kruijff, Dietrich Klakow
SIGMOD
2005
ACM
144views Database» more  SIGMOD 2005»
14 years 10 months ago
Mining Periodic Patterns with Gap Requirement from Sequences
We study a problem of mining frequently occurring periodic patterns with a gap requirement from sequences. Given a character sequence S of length L and a pattern P of length l, we...
Minghua Zhang, Ben Kao, David Wai-Lok Cheung, Kevi...
ICDE
2011
IEEE
263views Database» more  ICDE 2011»
13 years 1 months ago
Adding regular expressions to graph reachability and pattern queries
—It is increasingly common to find graphs in which edges bear different types, indicating a variety of relationships. For such graphs we propose a class of reachability queries ...
Wenfei Fan, Jianzhong Li, Shuai Ma, Nan Tang, Ying...
COCOON
2006
Springer
14 years 1 months 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, ...