2773 search results - page 435 / 555 » Decomposing Social Networks |
192
click to vote
PIMRC
2010
IEEE
15 years 4 months ago
2010
IEEE
Abstract--Is the temporal dimension alone sufficient to characterize contacts in opportunistic networks? Several studies analyze the temporal aspect of contacts with significant re...
174
click to vote
WWW
2010
ACM
16 years 1 months ago
2010
ACM
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
200
click to vote
MSWIM
2009
ACM
16 years 1 months ago
2009
ACM
Fairness in multihop ad hoc networks has received considerable attention in the literature. Many schemes have been proposed, which attempt to compute the “optimal” bit rates o...
176
click to vote
ICDM
2009
IEEE
16 years 1 months ago
2009
IEEE
This paper offers a local distributed algorithm for expectation maximization in large peer-to-peer environments. The algorithm can be used for a variety of well-known data mining...
190
click to vote
IUI
2005
ACM
15 years 12 months ago
2005
ACM
In this paper, we present our efforts towards creating interfaces for networked media exploration and collaborative annotation. The problem is important since online social networ...