Sciweavers

319 search results - page 59 / 64
» Parallel Belief Revision
Sort
View
ICDCS
2010
IEEE
13 years 11 months ago
LT Network Codes
This paper proposes LTNC, a new recoding algorithm to build low complexity network codes. At the core of LTNC is a decentralized version of LT codes that allows the use of fast be...
Mary-Luc Champel, Kévin Huguenin, Anne-Mari...
PODC
2010
ACM
13 years 9 months ago
Brief announcement: revisiting the power-law degree distribution for social graph analysis
The study of complex networks led to the belief that the connectivity of network nodes generally follows a Power-law distribution. In this work, we show that modeling large-scale ...
Alessandra Sala, Haitao Zheng, Ben Y. Zhao, Sabrin...
JMLR
2010
145views more  JMLR 2010»
13 years 2 months ago
Parallelizable Sampling of Markov Random Fields
Markov Random Fields (MRFs) are an important class of probabilistic models which are used for density estimation, classification, denoising, and for constructing Deep Belief Netwo...
James Martens, Ilya Sutskever
WINE
2005
Springer
107views Economy» more  WINE 2005»
14 years 24 days ago
Price of Anarchy of Network Routing Games with Incomplete Information
We consider a class of networks where n agents need to send their traffic from a given source to a given destination over m identical, non-intersecting, and parallel links. For suc...
Dinesh Garg, Yadati Narahari
HLPPP
1991
13 years 11 months ago
The Chemical Reaction Model
Gamma was originally proposed in 1986 as a formalism for the de nition of programs without arti cial sequentiality. The basic idea underlying the formalism is to describe computati...
Daniel Le Métayer