Sciweavers

3204 search results - page 127 / 641
» The Alcuin Number of a Graph
Sort
View
COLT
2004
Springer
14 years 1 months ago
Regularization and Semi-supervised Learning on Large Graphs
We consider the problem of labeling a partially labeled graph. This setting may arise in a number of situations from survey sampling to information retrieval to pattern recognition...
Mikhail Belkin, Irina Matveeva, Partha Niyogi
WEA
2004
Springer
110views Algorithms» more  WEA 2004»
14 years 1 months ago
A Dynamic Algorithm for Topologically Sorting Directed Acyclic Graphs
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...
David J. Pearce, Paul H. J. Kelly
ACCV
2009
Springer
14 years 26 days ago
Video Segmentation Using Iterated Graph Cuts Based on Spatio-temporal Volumes
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...
Tomoyuki Nagahashi, Hironobu Fujiyoshi, Takeo Kana...
COMBINATORICS
1998
103views more  COMBINATORICS 1998»
13 years 8 months ago
Recognizing Circulant Graphs of Prime Order in Polynomial Time
A circulant graph G of order n is a Cayley graph over the cyclic group Zn. Equivalently, G is circulant iff its vertices can be ordered such that the corresponding adjacency matr...
Mikhail E. Muzychuk, Gottfried Tinhofer
COR
2011
13 years 3 months ago
On the application of graph colouring techniques in round-robin sports scheduling
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
R. Lewis, J. Thompson