Sciweavers

44 search results - page 5 / 9
» Mining directed social network from message board
Sort
View
SAC
2011
ACM
12 years 10 months ago
Towards discovering criminal communities from textual data
In many criminal cases, forensically collected data contain valuable information about a suspect’s social networks. An investigator often has to manually extract information fro...
Rabeah Al-Zaidy, Benjamin C. M. Fung, Amr M. Youss...
NSDI
2008
13 years 10 months ago
Ostra: Leveraging Trust to Thwart Unwanted Communication
Online communication media such as email, instant messaging, bulletin boards, voice-over-IP, and social networking sites allow any sender to reach potentially millions of users at...
Alan Mislove, Ansley Post, Peter Druschel, P. Kris...
JSAC
2007
87views more  JSAC 2007»
13 years 7 months ago
Hidden-Action in Network Routing
— In communication networks, such as the Internet or mobile ad-hoc networks, the actions taken by intermediate nodes or links are typically hidden from the communicating endpoint...
Michal Feldman, John Chuang, Ion Stoica, Scott She...
INFOCOM
2009
IEEE
14 years 2 months ago
Fair Routing in Delay Tolerant Networks
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
Josep M. Pujol, Alberto Lopez Toledo, Pablo Rodrig...
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