Sciweavers

218 search results - page 40 / 44
» Adaptive Gossip-Based Broadcast
Sort
View
PODC
2010
ACM
13 years 6 months ago
Meeting the deadline: on the complexity of fault-tolerant continuous gossip
In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the go...
Chryssis Georgiou, Seth Gilbert, Dariusz R. Kowals...
GLOBECOM
2010
IEEE
13 years 5 months ago
Throughput and Energy Efficiency of Opportunistic Routing with Type-I HARQ in Linear Multihop Networks
Opportunistic routing is a well-known technique that exploits the broadcast nature of wireless transmissions and path diversity to form the route in an adaptive manner based on cur...
Davide Chiarotto, Osvaldo Simeone, Michele Zorzi
APNOMS
2006
Springer
13 years 11 months ago
"P4L": A Four Layers P2P Model for Optimizing Resources Discovery and Localization
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high...
Mourad Amad, Ahmed Meddahi
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 11 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
CHI
2003
ACM
14 years 8 months ago
The digital set-top box as a virtual channel provider
This research is based on the realization that the desktop computing paradigm is not appropriate for television, because it is adapted to fundamentally different user aspirations ...
Konstantinos Chorianopoulos