856 search results - page 80 / 172 » On Randomness Measures for Social Networks. |
165
click to vote
INFOCOM
2009
IEEE
16 years 28 days ago
2009
IEEE
—The typical state-of-the-art routing algorithms for delay tolerant networks are based on best next hop hill-climbing heuristics in order to achieve throughput and efficiency. T...
181
click to vote
PKAW
2010
15 years 4 months ago
2010
Abstract. Estimating influence of a node is an important problem in social network analyses. We address this problem in a particular class of model for opinion propagation in whic...
163
click to vote
ASUNAM
2010
IEEE
15 years 7 months ago
2010
IEEE
The goal of semi-supervised learning (SSL) methods is to reduce the amount of labeled training data required by learning from both labeled and unlabeled instances. Macskassy and Pr...
159
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
: We initiate the study of local, sublinear time algorithms for finding vertices with extreme topological properties -- such as high degree or clustering coefficient -- in large so...
164
click to vote
TCOM
2008
15 years 6 months ago
2008
We investigate the use of distributed measurements for estimating and updating the performance of a cellular system. Specifically, we discuss the number and placement of sensors in...