267 search results - page 22 / 54 » Anti-Ramsey properties of random graphs |
109
click to vote
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Recently, research on disconnected networks has been fostered by several studies on delay-tolerant networks, which are designed in order to sustain disconnected operations. We ...
120
click to vote
RSA
2010
14 years 10 months ago
2010
We study here the spectra of random lifts of graphs. Let G be a finite connected graph, and let the infinite tree T be its universal cover space. If λ1 and ρ are the spectral ...
131
click to vote
TVCG
2011
14 years 6 months ago
2011
—This paper considers the problem of interactively finding the cutting contour to extract components from an existing mesh. First, we propose a constrained random walks algorith...
119
click to vote
SPAA
2009
ACM
15 years 6 months ago
2009
ACM
We consider bit communication complexity of binary consensus in synchronous message passing systems with processes prone to crashes. A distributed algorithm is locally scalable wh...
114
click to vote
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Belief propagation (BP) has become widely used for low-level vision problems and various inference techniques have been proposed for loopy graphs. These methods typically rely on a...