617 search results - page 94 / 124 » On the Chromatic Number of Random Graphs |
140
click to vote
IJCV
2012
13 years 6 months ago
2012
Abstract Computer vision is full of problems elegantly expressed in terms of energy minimization. We characterize a class of energies with hierarchical costs and propose a novel hi...
136
click to vote
STOC
2007
ACM
16 years 4 months ago
2007
ACM
Given as input a directed graph on N vertices and a set of source-destination pairs, we study the problem of routing the maximum possible number of source-destination pairs on pat...
157
click to vote
IPPS
2010
IEEE
15 years 2 months ago
2010
IEEE
Abstract--For the management of a virtual P2P supercomputer one is interested in subgroups of processors that can communicate with each other efficiently. The task of finding these...
183
click to vote
MST
2010
14 years 11 months ago
2010
We study local, distributed algorithms for the capacitated minimum dominating set (CapMDS) problem, which arises in various distributed network applications. Given a network graph...
124
click to vote
ICC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract—This paper studies probabilistic information dissemination in random networks. Consider the following scenario: A node intends to deliver a message to all other nodes in...