Sciweavers

209 search results - page 33 / 42
» Mixed Cumulative Distribution Networks
Sort
View
CCS
2010
ACM
14 years 8 months ago
Designs to account for trust in social network-based sybil defenses
Social network-based Sybil defenses exploit the trust exhibited in social graphs to detect Sybil nodes that disrupt an algorithmic property (i.e., the fast mixing) in these graphs...
Abedelaziz Mohaisen, Nicholas Hopper, Yongdae Kim
INFOCOM
2005
IEEE
15 years 3 months ago
Gossip algorithms: design, analysis and applications
Abstract— Motivated by applications to sensor, peer-topeer and ad hoc networks, we study distributed asynchronous algorithms, also known as gossip algorithms, for computation and...
Stephen P. Boyd, Arpita Ghosh, Balaji Prabhakar, D...
ICASSP
2009
IEEE
15 years 4 months ago
Field inversion by consensus and compressed sensing
— We study the inversion of a random field from pointwise measurements collected by a sensor network. We assume that the field has a sparse representation in a known basis. To ...
Aurora Schmidt, José M. F. Moura
NETWORK
2007
93views more  NETWORK 2007»
14 years 9 months ago
Modeling VoIP Call Holding Times for Telecommunications
Voice over IP is one of the most popular applications in broadband access networks. It is anticipated that the characteristics of call holding times (CHTs) for VoIP calls will be ...
Whai-En Chen, Hui-Nien Hung, Yi-Bing Lin
RSA
2000
170views more  RSA 2000»
14 years 9 months ago
Delayed path coupling and generating random permutations
We analyze various stochastic processes for generating permutations almost uniformly at random in distributed and parallel systems. All our protocols are simple, elegant and are b...
Artur Czumaj, Miroslaw Kutylowski