Sciweavers

2479 search results - page 128 / 496
» Random Event Structures
Sort
View
128
Voted
MICS
2010
134views more  MICS 2010»
14 years 11 months ago
Scale Free Properties of Random k-Trees
Scale free graphs have attracted attention as their non-uniform structure that can be used as a model for many social networks including the WWW and the Internet. In this paper, w...
Colin Cooper, Ryuhei Uehara
104
Voted
CORR
2006
Springer
142views Education» more  CORR 2006»
15 years 1 months ago
Decentralized Erasure Codes for Distributed Networked Storage
We consider the problem of constructing an erasure code for storage over a network when the data sources are distributed. Specifically, we assume that there are n storage nodes wit...
Alexandros G. Dimakis, Vinod M. Prabhakaran, Kanna...
90
Voted
SPAA
2005
ACM
15 years 6 months ago
Decentralized algorithms using both local and random probes for P2P load balancing
We study randomized algorithms for placing a sequence of n nodes on a circle with unit perimeter. Nodes divide the circle into disjoint arcs. We desire that a newly-arrived node (...
Krishnaram Kenthapadi, Gurmeet Singh Manku
108
Voted
ITSL
2008
15 years 2 months ago
A Randomized Complexity-theoretic Model of Bio-inspired Mobile Epidemics via Close Contact
In this paper we present a randomized complexity theoretic model for those epidemics propagated via short-distance close contact. We prove that the contact-based epidemics problems...
Zhen Cao, Jiejun Kong, Mario Gerla, Dapeng Wu
130
Voted
NIPS
2008
15 years 2 months ago
Multiscale Random Fields with Application to Contour Grouping
We introduce a new interpretation of multiscale random fields (MSRFs) that admits efficient optimization in the framework of regular (single level) random fields (RFs). It is base...
Longin Jan Latecki, ChengEn Lu, Marc Sobel, Xiang ...