Sciweavers

3017 search results - page 192 / 604
» On compressing social networks
Sort
View
CORR
2010
Springer
177views Education» more  CORR 2010»
15 years 6 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
ICIP
2002
IEEE
16 years 8 months ago
Optimal protection assignment for scalable compressed images
This paper is concerned with the efficient transmission of scalable compressed images over lossy communication channels. Recent works have proposed several strategies for assignin...
Johnson Thie, David Taubman
WWW
2005
ACM
16 years 7 months ago
Disambiguating Web appearances of people in a social network
Say you are looking for information about a particular person. A search engine returns many pages for that person's name but which pages are about the person you care about, ...
Ron Bekkerman, Andrew McCallum
KDD
2009
ACM
190views Data Mining» more  KDD 2009»
16 years 7 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
SIGECOM
2009
ACM
137views ECommerce» more  SIGECOM 2009»
16 years 1 months ago
An exact almost optimal algorithm for target set selection in social networks
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...
Oren Ben-Zwi, Danny Hermelin, Daniel Lokshtanov, I...