Sciweavers

103 search results - page 17 / 21
» Full-healing group-key distribution in online social network...
Sort
View
CIKM
2010
Springer
15 years 5 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
MIR
2010
ACM
264views Multimedia» more  MIR 2010»
16 years 26 days ago
Quest for relevant tags using local interaction networks and visual content
Typical tag recommendation systems for photos shared on social networks such as Flickr, use visual content analysis, collaborative filtering or personalization strategies to prod...
Neela Sawant, Ritendra Datta, Jia Li, James Ze Wan...
STOC
2007
ACM
127views Algorithms» more  STOC 2007»
16 years 6 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 ...
IEEECIT
2010
IEEE
15 years 4 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...
SAC
2010
ACM
16 years 1 months ago
Trustworthy interaction balancing in mixed service-oriented systems
Web-based collaboration systems typically require dynamic and context-based interactions between people and services. To support such complex interaction scenarios, we introduce a...
Florian Skopik, Daniel Schall, Schahram Dustdar