Sciweavers

225 search results - page 43 / 45
» Privacy-enhanced social network routing in opportunistic net...
Sort
View
SIROCCO
2008
14 years 11 months ago
Recovering the Long-Range Links in Augmented Graphs
The augmented graph model, as introduced by Kleinberg (STOC 2000), is an appealing model for analyzing navigability in social networks. Informally, this model is defined by a pair...
Pierre Fraigniaud, Emmanuelle Lebhar, Zvi Lotker
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
15 years 10 months ago
First to market is not everything: an analysis of preferential attachment with fitness
The design of algorithms on complex networks, such as routing, ranking or recommendation algorithms, requires a detailed understanding of the growth characteristics of the network...
Christian Borgs, Jennifer T. Chayes, Constantinos ...
PET
2010
Springer
15 years 1 months ago
Drac: An Architecture for Anonymous Low-Volume Communications
We present Drac, a system designed to provide anonymity and unobservability for real-time instant messaging and voice-over-IP communications against a global passive adversary. The...
George Danezis, Claudia Díaz, Carmela Tronc...
CACM
2005
74views more  CACM 2005»
14 years 9 months ago
Separate handles from names on the internet
Networked communications inherently depend on the ability of the sender of a message to indicate through some token how the message should be delivered to a particular recipient. ...
Michael J. O'Donnell
SIGCOMM
2006
ACM
15 years 3 months ago
Systematic topology analysis and generation using degree correlations
Researchers have proposed a variety of metrics to measure important graph properties, for instance, in social, biological, and computer networks. Values for a particular graph met...
Priya Mahadevan, Dmitri V. Krioukov, Kevin R. Fall...