1538 search results - page 87 / 308 » Spectral Techniques in Graph Algorithms |
158
click to vote
ICASSP
2011
IEEE
14 years 5 months ago
2011
IEEE
We design two different strategies for computing the unknown content preferences in an online social network based on a small set of nodes in the corresponding social graph for wh...
113
click to vote
MICS
2008
15 years 1 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...
100
click to vote
JAIR
1998
15 years 1 months ago
1998
Using an improved backtrack algorithm with sophisticated pruning techniques, we revise previous observations correlating a high frequency of hard to solve Hamiltonian cycle instan...
JGAA
2000
15 years 1 months ago
2000
We describe a method for three-dimensional straight-line representation of dynamic directed graphs (such as parts of the World Wide Web). It has been developed on the occasion of ...
108
click to vote
ACCV
2006
Springer
15 years 7 months ago
2006
Springer
In this paper, we propose a new stereo matching algorithm using an iterated graph cuts and mean shift filtering technique. Our algorithm consists of following two steps. In the ...