3958 search results - page 193 / 792 » Dynamic Graph Algorithms with Applications |
165
click to vote
CVPR
2010
IEEE
15 years 11 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...
161
click to vote
WWW
2007
ACM
16 years 7 months ago
2007
ACM
We present a family of measures of proximity of an arbitrary node in a directed graph to a pre-specified subset of nodes, called the anchor. Our measures are based on three differ...
153
click to vote
GD
2009
Springer
15 years 11 months ago
2009
Springer
Canonical ordering is an important tool in planar graph drawing and other applications. Although a linear-time algorithm to determine canonical orderings has been known for a while...
124
click to vote
GD
2004
Springer
15 years 12 months ago
2004
Springer
In this paper we study simple families of clustered graphs that are highly unconnected. We start by studying 3-cluster cycles, which are clustered graphs such that the underlying ...
162
click to vote
IPPS
2006
IEEE
16 years 17 days ago
2006
IEEE
There are many application classes where the users are flexible with respect to the output quality. At the same time, there are other constraints, such as the need for real-time ...