267 search results - page 34 / 54 » Anti-Ramsey properties of random graphs |
CORR
2011
Springer
13 years 3 months ago
2011
Springer
Abstract—Breadth First Search (BFS) is a widely used approach for sampling large unknown Internet topologies. Its main advantage over random walks and other exploration technique...
PET
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. As decentralized computing scenarios get ever more popular, unstructured topologies are natural candidates to consider running mix networks upon. We consider mix network ...
AAAI
2011
12 years 8 months ago
2011
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
CVPR
2011
IEEE
13 years 11 days 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....
SODA
2000
ACM
13 years 10 months ago
2000
ACM
: k-SAT is one of the best known among a wide class of random constraint satisfaction problems believed to exhibit a threshold phenomenon where the control parameter is the ratio, ...