Sciweavers

2773 search results - page 369 / 555
» Decomposing Social Networks
Sort
View
BMCBI
2010
178views more  BMCBI 2010»
15 years 6 months ago
Selecting high-dimensional mixed graphical models using minimal AIC or BIC forests
Background: Chow and Liu showed that the maximum likelihood tree for multivariate discrete distributions may be found using a maximum weight spanning tree algorithm, for example K...
David Edwards, Gabriel C. G. de Abreu, Rodrigo Lab...
PERCOM
2010
ACM
15 years 5 months ago
Privacy assurance in mobile sensing networks: Go beyond trusted servers
—Mobile devices are becoming the largest sensor network around the world. They could be used to collect a large amount of data with little effort and cost which is leading to a p...
Ling Hu, Cyrus Shahabi
CIKM
2009
Springer
16 years 1 months ago
Self-organizing peer-to-peer networks for collaborative document tracking
Given a set of peers with overlapping interests where each peer wishes to keep track of new documents that are relevant to their interests, we propose a self-organizing peerto-pee...
Hathai Tanta-ngai, Evangelos E. Milios, Vlado Kese...
KAIS
2011
129views more  KAIS 2011»
15 years 1 months ago
Counting triangles in real-world networks using projections
Triangle counting is an important problem in graph mining. Two frequently used metrics in complex network analysis which require the count of triangles are the clustering coefficie...
Charalampos E. Tsourakakis
SIGMOD
2011
ACM
241views Database» more  SIGMOD 2011»
14 years 9 months ago
Neighborhood based fast graph search in large networks
Complex social and information network search becomes important with a variety of applications. In the core of these applications, lies a common and critical problem: Given a labe...
Arijit Khan, Nan Li, Xifeng Yan, Ziyu Guan, Supriy...