Sciweavers

2491 search results - page 387 / 499
» De-anonymizing Social Networks
Sort
View
CIKM
2009
Springer
16 years 22 days ago
Fast shortest path distance estimation in large networks
In this paper we study approximate landmark-based methods for point-to-point distance estimation in very large networks. These methods involve selecting a subset of nodes as landm...
Michalis Potamias, Francesco Bonchi, Carlos Castil...
176
Voted
ICASSP
2010
IEEE
15 years 6 months ago
Distributed learning in cognitive radio networks: Multi-armed bandit with distributed multiple players
—We consider a cognitive radio network with distributed multiple secondary users, where each user independently searches for spectrum opportunities in multiple channels without e...
Keqin Liu, Qing Zhao
179
Voted
ESA
2009
Springer
122views Algorithms» more  ESA 2009»
16 years 21 days ago
Bounded Budget Betweenness Centrality Game for Strategic Network Formations
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
Xiaohui Bei, Wei Chen, Shang-Hua Teng, Jialin Zhan...
AIRWEB
2007
Springer
16 years 10 days ago
Computing Trusted Authority Scores in Peer-to-Peer Web Search Networks
Peer-to-peer (P2P) networks have received great attention for sharing and searching information in large user communities. The open and anonymous nature of P2P networks is one of ...
Josiane Xavier Parreira, Debora Donato, Carlos Cas...
195
Voted
SIGECOM
2008
ACM
151views ECommerce» more  SIGECOM 2008»
15 years 6 months ago
Security and insurance management in networks with heterogeneous agents
Computer users express a strong desire to prevent attacks and to reduce the losses from computer and information security breaches. However, security compromises are common and wi...
Jens Grossklags, Nicolas Christin, John Chuang