2079 search results - page 297 / 416 » Universality of random graphs |
155
click to vote
CVPR
2011
IEEE
14 years 8 months ago
2011
IEEE
We propose a new objective function for superpixel segmentation. This objective function consists of two components: entropy rate of a random walk on a graph and a balancing term....
205
click to vote
PODC
2011
ACM
14 years 7 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
179
click to vote
CVPR
2012
IEEE
13 years 6 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...
162
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
The matching and retrieval of 2D shapes is an important
challenge in computer vision. A large number of shape
similarity approaches have been developed, with the main
focus bein...
191
click to vote
CVPR
2009
IEEE
16 years 11 months ago
2009
IEEE
In this paper, we propose a novel predictive model for
object boundary, which can integrate information from any
sources. The model is a dynamic “object” model whose
manifes...