Sciweavers

6740 search results - page 454 / 1348
» An s -Hamiltonian Line Graph Problem
Sort
View
ICDE
1998
IEEE
124views Database» more  ICDE 1998»
16 years 8 months ago
Graph Structured Views and Their Incremental Maintenance
We study the problem of maintaining materialized views of graph structured data. The base data consists of records containing identi ers of other records. The data could represent...
Yue Zhuge, Hector Garcia-Molina
GBRPR
2007
Springer
16 years 29 days ago
Local Reasoning in Fuzzy Attribute Graphs for Optimizing Sequential Segmentation
Spatial relations play a crucial role in model-based image recognition and interpretation due to their stability compared to many other image appearance characteristics. Graphs are...
Geoffroy Fouquier, Jamal Atif, Isabelle Bloch
MFCS
2004
Springer
16 years 5 days ago
Online Algorithms for Disk Graphs
We study the on-line versions of two fundamental graph problems, maximum independent set and minimum coloring, for the case of disk graphs which are graphs resulting from intersect...
Ioannis Caragiannis, Aleksei V. Fishkin, Christos ...
PKDD
2000
Springer
159views Data Mining» more  PKDD 2000»
15 years 10 months ago
An Apriori-Based Algorithm for Mining Frequent Substructures from Graph Data
Abstract. This paper proposes a novel approach named AGM to eciently mine the association rules among the frequently appearing substructures in a given graph data set. A graph tran...
Akihiro Inokuchi, Takashi Washio, Hiroshi Motoda
EMNLP
2006
15 years 8 months ago
Inducing Temporal Graphs
We consider the problem of constructing a directed acyclic graph that encodes temporal relations found in a text. The unit of our analysis is a temporal segment, a fragment of tex...
Philip Bramsen, Pawan Deshpande, Yoong Keok Lee, R...