149
click to vote
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
—The problem of predicting links or interactions between objects in a network, is an important task in network analysis. Along this line, link prediction between co-authors in a ...
242
click to vote
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
—A co-offending network is a network of offenders who have committed crimes together. Recently different researches have shown that there is a fairly strong concept of network am...
166
click to vote
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
—Social and communication networks across the world generate vast amounts of graph-like data each day. The modeling and prediction of how these communication structures evolve ca...
251
click to vote
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
—With the rise of network science as an exciting interdisciplinary research topic, efficient graph algorithms are in high demand. Problematically, many such algorithms measuring...
251
click to vote
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—In this paper we introduce a new model to represent an interconnected network of networks. This model is fundamental to reason about the real organization of on-line soc...
146
click to vote
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
—In this paper, we study the problem of evolutionary clustering of multi-typed objects in a heterogeneous bibliographic network. The traditional methods of homogeneous clustering...
145
Voted
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
—Bibliographic databases are a prosperous field for data mining research and social network analysis. They contain rich information, which can be analyzed across different dimen...
139
Voted
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
—Social networks and discussion boards have become a significant outlet where people communicate and express their opinion freely. Although the social networks themselves are us...
150
Voted
ASUNAM
2011
IEEE
14 years 3 months ago
2011
IEEE
Abstract—Community detection or cluster detection in networks is a well-studied, albeit hard, problem. Given the scale and complexity of modern day social networks, detecting “...
178
click to vote
ASIACRYPT
2011
Springer
14 years 3 months ago
2011
Springer
We provide constructions of (m, 1)-programmable hash functions (PHFs) for m ≥ 2. Mimicking certain programmability properties of random oracles, PHFs can, e.g., be plugged into ...