256 search results - page 16 / 52 » Sparse random graphs with clustering |
GBRPR
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
MICCAI
2010
Springer
13 years 6 months ago
2010
Springer
We present a novel approach for extracting cluttered objects based on their morphological properties1 . Specifically, we address the problem of untangling C. elegans clusters in h...
CVPR
2012
IEEE
11 years 10 months ago
2012
IEEE
A greedy-based approach to learn a compact and discriminative dictionary for sparse representation is presented. We propose an objective function consisting of two components: ent...
ICML
2005
IEEE
14 years 8 months ago
2005
IEEE
Semi-supervised clustering algorithms aim to improve clustering results using limited supervision. The supervision is generally given as pairwise constraints; such constraints are...
ICALP
2009
Springer
14 years 2 months ago
2009
Springer
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...