803 search results - page 106 / 161 » Independence in Direct-Product Graphs |
CPC
2006
15 years 26 days ago
2006
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
115
Voted
CVPR
2011
IEEE
14 years 4 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....
110
click to vote
CVPR
2003
IEEE
16 years 2 months ago
2003
IEEE
Probabilistic models have been adopted for many computer vision applications, however inference in highdimensional spaces remains problematic. As the statespace of a model grows, ...
110
click to vote
PODC
2010
ACM
15 years 4 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
106
Voted
COMBINATORICA
2008
15 years 28 days ago
2008
Consider the following seemingly rhetorical question: Is it crucial for a property-tester to know the error parameter in advance? Previous papers dealing with various testing prob...