Sciweavers

326 search results - page 47 / 66
» Digital Signature Scheme Based on a New Hard Problem
Sort
View
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
14 years 8 months ago
Efficient influence maximization in social networks
Influence maximization is the problem of finding a small subset of nodes (seed nodes) in a social network that could maximize the spread of influence. In this paper, we study the ...
Wei Chen, Yajun Wang, Siyu Yang
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 8 months ago
Learning optimal ranking with tensor factorization for tag recommendation
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
Steffen Rendle, Leandro Balby Marinho, Alexandros ...
PODC
2006
ACM
14 years 1 months ago
Computing separable functions via gossip
Motivated by applications to sensor, peer-to-peer, and adhoc networks, we study the problem of computing functions of values at the nodes in a network in a totally distributed man...
Damon Mosk-Aoyama, Devavrat Shah
KDD
2005
ACM
149views Data Mining» more  KDD 2005»
14 years 1 months ago
A distributed learning framework for heterogeneous data sources
We present a probabilistic model-based framework for distributed learning that takes into account privacy restrictions and is applicable to scenarios where the different sites ha...
Srujana Merugu, Joydeep Ghosh
DIALM
2005
ACM
130views Algorithms» more  DIALM 2005»
13 years 9 months ago
On lower bounds for MAC layer contention in CSMA/CA-based wireless networks
Wireless LANs operating within unlicensed frequency bands require random access schemes such as CSMA/CA, so that wireless networks from different administrative domains (for exam...
Frank A. Zdarsky, Ivan Martinovic, Jens B. Schmitt