Sciweavers

2773 search results - page 482 / 555
» Decomposing Social Networks
Sort
View
TIS
1998
106views more  TIS 1998»
15 years 6 months ago
The Meaning of the Web
Speculation about the meaning of the "Net" (the Internet and potentially associated networks), and its most rapidly developing dimension, the "Web" (the World ...
Jim Falk
PAMI
2007
202views more  PAMI 2007»
15 years 5 months ago
Weighted Graph Cuts without Eigenvectors A Multilevel Approach
—A variety of clustering algorithms have recently been proposed to handle data that is not linearly separable; spectral clustering and kernel k-means are two of the main methods....
Inderjit S. Dhillon, Yuqiang Guan, Brian Kulis
SAC
2008
ACM
15 years 5 months ago
Privacy-preserving link discovery
Abstract. Link discovery is a process of identifying association(s) among different entities included in a complex network structure. These association(s) may represent any interac...
Xiaoyun He, Basit Shafiq, Jaideep Vaidya, Nabil R....
IEEECIT
2010
IEEE
15 years 4 months ago
A P2P REcommender System based on Gossip Overlays (PREGO)
—Gossip-based Peer-to-Peer protocols proved to be very efficient for supporting dynamic and complex information exchange among distributed peers. They are useful for building an...
Matteo Mordacchini, Ranieri Baraglia, Patrizio Daz...
JDA
2010
131views more  JDA 2010»
15 years 4 months ago
Convex drawings of hierarchical planar graphs and clustered planar graphs
: Hierarchical graphs are graphs with layering structures; clustered graphs are graphs with recursive clustering structures. Both have applications in VLSI design, CASE tools, soft...
Seok-Hee Hong, Hiroshi Nagamochi