4171 search results - page 235 / 835 » Choice numbers of graphs |
159
click to vote
WEA
2004
Springer
16 years 1 days ago
2004
Springer
Abstract. We consider how to maintain the topological order of a directed acyclic graph (DAG) in the presence of edge insertions and deletions. We present a new algorithm and, alth...
261
click to vote
ACCV
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. We present a novel approach to segmenting video using iterated graph cuts based on spatio-temporal volumes. We use the mean shift clustering algorithm to build the spatio...
170
click to vote
ESANN
2007
15 years 8 months ago
2007
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
189
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
190
click to vote
FLAIRS
2004
15 years 8 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...