Sciweavers

2678 search results - page 464 / 536
» Voting in social networks
Sort
View
SAC
2008
ACM
13 years 8 months ago
Privacy-preserving link discovery
Abstract. Link discovery is a process of identifying association(s) among different entities included in a complex network structure. These association(s) may represent any interac...
Xiaoyun He, Basit Shafiq, Jaideep Vaidya, Nabil R....
IEEECIT
2010
IEEE
13 years 7 months ago
A P2P REcommender System based on Gossip Overlays (PREGO)
—Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building an...
Matteo Mordacchini, Ranieri Baraglia, Patrizio Daz...
JDA
2010
131views more  JDA 2010»
13 years 7 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi
PVLDB
2010
152views more  PVLDB 2010»
13 years 7 months ago
k-Nearest Neighbors in Uncertain Graphs
Complex networks, such as biological, social, and communication networks, often entail uncertainty, and thus, can be modeled as probabilistic graphs. Similar to the problem of sim...
Michalis Potamias, Francesco Bonchi, Aristides Gio...
WIOPT
2010
IEEE
13 years 7 months ago
A contracts-based approach for spectrum sharing among cognitive radios
Abstract—Development of dynamic spectrum access and allocation techniques recently have made feasible the vision of cognitive radio systems. However, a fundamental question arise...
Dileep M. Kalathil, Rahul Jain