549 search results - page 53 / 110 » Computing All the Best Swap Edges Distributively |
ICS
2010
Tsinghua U.
15 years 7 months ago
2010
Tsinghua U.
: Many natural games can have a dramatic difference between the quality of their best and worst Nash equilibria, even in pure strategies. Yet, nearly all work to date on dynamics s...
CIKM
2011
Springer
13 years 9 months ago
2011
Springer
We consider the problem of link prediction in signed networks. Such networks arise on the web in a variety of ways when users can implicitly or explicitly tag their relationship w...
101
click to vote
PODC
2004
ACM
15 years 3 months ago
2004
ACM
We analyze the properties of Small-World networks, where links are much more likely to connect “neighbor nodes” than distant nodes. In particular, our analysis provides new re...
INFOVIS
2000
IEEE
15 years 2 months ago
2000
IEEE
Two tasks in Graph Visualization require partitioning: the assignment of visual attributes and divisive clustering. Often, we would like to assign a color or other visual attribut...
NCA
2005
IEEE
15 years 3 months ago
2005
IEEE
In systems where customer service demands are only known probabilistically, there is very little to distinguish between jobs. Therefore, no universal optimum scheduling strategy o...