Sciweavers

2092 search results - page 301 / 419
» A Theory of Non-Deterministic Networks
Sort
View
PODC
2005
ACM
15 years 5 months ago
On the locality of bounded growth
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
Fabian Kuhn, Thomas Moscibroda, Roger Wattenhofer
CN
2010
121views more  CN 2010»
14 years 8 months ago
Probabilistic flooding for efficient information dissemination in random graph topologies
Probabilistic flooding has been frequently considered as a suitable dissemination information approach for limiting the large message overhead associated with traditional (full) f...
Konstantinos Oikonomou, Dimitrios Kogias, Ioannis ...
WWW
2008
ACM
16 years 12 days ago
Trust-based recommendation systems: an axiomatic approach
High-quality, personalized recommendations are a key feature in many online systems. Since these systems often have explicit knowledge of social network structures, the recommenda...
Reid Andersen, Christian Borgs, Jennifer T. Chayes...
PE
2002
Springer
176views Optimization» more  PE 2002»
14 years 11 months ago
Effective bandwidth estimation and testing for Markov sources
This work addresses the resource sharing problem in broadband communication networks that can guarantee some quality of service (QoS), and develops some results about data source ...
Juan Pechiar, Gonzalo Perera, María Simon
CORR
2010
Springer
184views Education» more  CORR 2010»
14 years 11 months ago
Strong Secrecy and Reliable Byzantine Detection in the Presence of an Untrusted Relay
We consider a Gaussian two-hop network where the source and the destination can communicate only via a relay node who is both an eavesdropper and a Byzantine adversary. Both the s...
Xiang He, Aylin Yener