66 search results - page 3 / 14 » Finding Graph Matchings in Data Streams |
CORR
2010
Springer
13 years 10 months ago
2010
Springer
Given a directed acyclic graph with labeled vertices, we consider the problem of finding the most common label sequences ("traces") among all paths in the graph (of some...
KDD
2007
ACM
14 years 10 months ago
2007
ACM
We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find s...
FLAIRS
2006
13 years 11 months ago
2006
Inexact graph matching has become an important research area because it is used to find similarities among objects in several real domains such as chemical and biological compound...
ICALP
2009
Springer
14 years 10 months ago
2009
Springer
The central goal of data stream algorithms is to process massive streams of data using sublinear storage space. Motivated by work in the database community on outsourcing database...
ICMCS
2005
IEEE
14 years 3 months ago
2005
IEEE
We propose a new graph-based data structure, called Spatio Temporal Region Graph (STRG) which can represent the content of video sequence. Unlike existing ones which consider main...