820 search results - page 42 / 164 » Inducing Temporal Graphs |
APCSAC
2005
IEEE
14 years 2 months ago
2005
IEEE
Conditional branch induced control hazards cause significant performance loss in modern out-of-order superscalar processors. Dynamic branch prediction techniques help alleviate th...
DASFAA
2004
IEEE
14 years 7 days ago
2004
IEEE
In this paper, a State-Based Dynamic Transportation Network (SBDTN) model is presented, which can be used to describe the spatiotemporal aspect of temporally variable transportatio...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...
ICIP
2002
IEEE
14 years 10 months ago
2002
IEEE
In this paper, we present a system for the temporal segmentation, summarization, and browsing of the Echocardiogram videos. Echocardiogram videos are video sequences produced by t...
JGT
2006
13 years 8 months ago
2006
Abstract: A k-tree is a chordal graph with no (k + 2)-clique. An -treepartition of a graph G is a vertex partition of G into `bags,' such that contracting each bag to a single...