Sciweavers

524 search results - page 33 / 105
» Temporal reachability graphs
Sort
View
ISM
2006
IEEE
129views Multimedia» more  ISM 2006»
15 years 3 months ago
A Graph-Based Approach for Modeling and Indexing Video Data
In this work, we propose new graph-based data model and indexing to organize and manage video data. To consider spatial and temporal characteristics of video, we introduce a new g...
JeongKyu Lee
132
Voted
SAC
2010
ACM
15 years 10 months ago
Mining temporal relationships among categories
Temporal text mining deals with discovering temporal patterns in text over a period of time. A Theme Evolution Graph (TEG) is used to visualize when new themes are created and how...
Saket S. R. Mengle, Nazli Goharian
130
Voted
CIBCB
2008
IEEE
15 years 9 months ago
Temporal and structural analysis of biological networks in combination with microarray data
— We introduce a graph-based relational learning approach using graph-rewriting rules for temporal and structural analysis of biological networks changing over time. The analysis...
Chang Hun You, Lawrence B. Holder, Diane J. Cook
142
Voted
PRICAI
1998
Springer
15 years 7 months ago
Point-Based Approaches to Qualitative Temporal Reasoning
Weaddress the general problemof finding algorithms for efficient, qualitative, point-basedtemporalreasoning over a set of operations. Weconsider general reasonerstailored for temp...
Tim Van Allen, James P. Delgrande, Arvind Gupta
106
Voted
CORR
2010
Springer
142views Education» more  CORR 2010»
15 years 1 months ago
HyperANF: Approximating the Neighbourhood Function of Very Large Graphs on a Budget
The neighbourhood function NG(t) of a graph G gives, for each t ∈ N, the number of pairs of nodes x, y such that y is reachable from x in less that t hops. The neighbourhood fun...
Paolo Boldi, Marco Rosa, Sebastiano Vigna