Sciweavers

267 search results - page 48 / 54
» On the approximability of influence in social networks
Sort
View
ICDM
2008
IEEE
222views Data Mining» more  ICDM 2008»
14 years 3 months ago
GRAPHITE: A Visual Query System for Large Graphs
We present Graphite, a system that allows the user to visually construct a query pattern, finds both its exact and approximate matching subgraphs in large attributed graphs, and ...
Duen Horng Chau, Christos Faloutsos, Hanghang Tong...
KDD
2003
ACM
175views Data Mining» more  KDD 2003»
14 years 9 months ago
Time and sample efficient discovery of Markov blankets and direct causal relations
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
Ioannis Tsamardinos, Constantin F. Aliferis, Alexa...
CORR
2011
Springer
202views Education» more  CORR 2011»
13 years 3 months ago
Multi-skill Collaborative Teams based on Densest Subgraphs
We consider the problem of identifying a team of skilled individuals for collaboration, in the presence of a social network. Each node in the input social network may be an expert...
Amita Gajewar, Atish Das Sarma
CORR
2008
Springer
150views Education» more  CORR 2008»
13 years 8 months ago
A Local Mean Field Analysis of Security Investments in Networks
Getting agents in the Internet, and in networks in general, to invest in and deploy security features and protocols is a challenge, in particular because of economic reasons arisi...
Marc Lelarge, Jean Bolot
SIGMETRICS
2010
ACM
193views Hardware» more  SIGMETRICS 2010»
13 years 9 months ago
Distributed caching over heterogeneous mobile networks
Sharing content over a mobile network through opportunistic contacts has recently received considerable attention. In proposed scenarios, users store content they download in a lo...
Stratis Ioannidis, Laurent Massoulié, Augus...