1722 search results - page 72 / 345 » On the sample mean of graphs |
197
click to vote
TIP
2010
15 years 4 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 ...
181
click to vote
CVPR
2004
IEEE
16 years 8 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...
254
click to vote
COMPGEOM
2011
ACM
14 years 9 months ago
2011
ACM
Many real-world data sets can be viewed of as noisy samples of special types of metric spaces called metric graphs [16]. Building on the notions of correspondence and GromovHausdo...
197
click to vote
PAMI
2010
15 years 4 months ago
2010
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
171
click to vote
ICPP
2005
IEEE
15 years 11 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...