125 search results - page 20 / 25 » Growth of components in random graphs |
CVPR
2011
IEEE
12 years 11 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....
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...
ICALP
2001
Springer
14 years 3 days ago
2001
Springer
We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the set {1, . . . , w}, and given a ...
BMCBI
2006
13 years 7 months ago
2006
Background: Common fragile sites (cfs) are specific regions in the human genome that are particularly prone to genomic instability under conditions of replicative stress. Several ...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Cuckoo hashing with a stash is a robust high-performance hashing scheme that can be used in many real-life applications. It complements cuckoo hashing by adding a small stash stor...