1172 search results - page 31 / 235 » Path Algorithms on Regular Graphs |
ICASSP
2011
IEEE
12 years 11 months ago
2011
IEEE
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...
MICS
2008
13 years 7 months ago
2008
Multi-level overlay graphs represent a speed-up technique for shortest paths computation which is based on a hierarchical decomposition of a weighted directed graph G. They have b...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
We present a study of multithreaded implementations of Thorup’s algorithm for solving the Single Source Shortest Path (SSSP) problem for undirected graphs. Our implementations l...
WDAG
2000
Springer
13 years 11 months ago
2000
Springer
A graph G with n vertices and maximum degree G cannot be given weak sense of direction using less than G colours. It is known that n colours are always sufficient, and it was conje...
ICPR
2008
IEEE
14 years 2 months ago
2008
IEEE
We present local and nonlocal algorithms for video denoising based on discrete regularization on graphs. The main difference between video and image denoising is the temporal redu...