267 search results - page 22 / 54 » Anti-Ramsey properties of random graphs |
INFOCOM
2007
IEEE
14 years 2 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 ...
RSA
2010
13 years 7 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 ...
TVCG
2011
13 years 3 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...
SPAA
2009
ACM
14 years 3 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...
ECCV
2006
Springer
14 years 10 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...