3267 search results - page 463 / 654 » Generalized quasirandom graphs |
195
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
Many real-life graphs such as social networks and peer-topeer networks capture the relationships among the nodes by using trust scores to label the edges. Important usage of such ...
217
click to vote
WWW
2011
ACM
15 years 1 months ago
2011
ACM
The clustering coefficient of a node in a social network is a fundamental measure that quantifies how tightly-knit the community is around the node. Its computation can be reduce...
216
click to vote
SIAMIS
2010
15 years 1 months ago
2010
Simulated annealing (SA) and deterministic continuation are well-known generic approaches to global optimization. Deterministic continuation is computationally attractive but produ...
234
click to vote
TASE
2010
IEEE
15 years 1 months ago
2010
IEEE
This paper focuses on the assignment of discrete points among K robots and determining the order in which the points should be processed by the robots, in the presence of geometric...
192
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
Abstract. In this paper, we propose a new construction of constantdegree expanders motivated by their application in P2P overlay networks and in particular in the design of robust ...