820 search results - page 70 / 164 » Inducing Temporal Graphs |
136
Voted
RTA
2010
Springer
15 years 6 months ago
2010
Springer
In earlier work, we have shown that for confluent term rewrite systems (TRSs for short), innermost polynomial runtime complexity induces polytime computability of the functions de...
115
click to vote
NN
2006
Springer
15 years 2 months ago
2006
Springer
- Contiguity Analysis is a straightforward generalization of Linear Discriminant Analysis in which the partition of elements is replaced by a more general graph structure. Applied ...
129
Voted
ENTCS
2006
15 years 2 months ago
2006
Using graph transformation as a formalism to specify model transformation, termination and confluence of the graph transformation system are often required properties. Only under ...
114
click to vote
CVPR
2010
IEEE
15 years 6 months ago
2010
IEEE
We present an efficient and scalable technique for spatiotemporal segmentation of long video sequences using a hierarchical graph-based algorithm. We begin by oversegmenting a vol...
116
click to vote
COMBINATORICS
2007
15 years 2 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...