779 search results - page 40 / 156 » Algorithms for the Sample Mean of Graphs |
163
click to vote
ACCV
2009
Springer
15 years 10 months ago
2009
Springer
Graph cuts based interactive segmentation has become very popular over the last decade. In standard graph cuts, the extraction of foreground object in a complex background often le...
166
click to vote
TIP
2010
15 years 2 months ago
2010
—We present in this paper a general formulation for nonnegative data factorization, called projective nonnegative graph embedding (PNGE), which 1) explicitly decomposes the data ...
147
click to vote
CVPR
2004
IEEE
16 years 6 months ago
2004
IEEE
Many vision tasks can be formulated as partitioning an adjacency graph through optimizing a Bayesian posterior probability p defined on the partition-space. In this paper two appr...
143
click to vote
ICPP
2005
IEEE
15 years 9 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
193
click to vote
ICASSP
2011
IEEE
14 years 8 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...