Sciweavers

856 search results - page 65 / 172
» On Randomness Measures for Social Networks.
Sort
View
INFOCOM
2006
IEEE
16 years 10 days ago
Loss-Cognizant Pricing in Feed-Forward Networks with Greedy Users
— We consider feed-forward packet switched networks with fixed routing and random congestion losses. Users of the network are assumed to be greedy in the sense that each user in...
Ashraf Al Daoud, Murat Alanyali
APWEB
2009
Springer
15 years 4 months ago
Core-Tag Clustering for Web 2.0 Based on Multi-similarity Measurements
Along with the development of Web2.0, folksonomy has become a hot topic related to data mining, information retrieval and social network. The tag semantic is the key for deep under...
Yexi Jiang, Changjie Tang, Kaikuo Xu, Lei Duan, Li...
WWW
2006
ACM
16 years 7 months ago
Probabilistic models for discovering e-communities
The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis...
Ding Zhou, Eren Manavoglu, Jia Li, C. Lee Giles, H...
WEBI
2009
Springer
16 years 27 days ago
Social Semantics and Its Evaluation by Means of Semantic Relatedness and Open Topic Models
—This paper presents an approach using social semantics for the task of topic labelling by means of Open Topic Models. Our approach utilizes a social ontology to create an alignm...
Ulli Waltinger, Alexander Mehler
FOCS
2008
IEEE
16 years 23 days ago
Mixing Time of Exponential Random Graphs
A plethora of random graph models have been developed in recent years to study a range of problems on networks, driven by the wide availability of data from many social, telecommu...
Shankar Bhamidi, Guy Bresler, Allan Sly