1591 search results - page 101 / 319 » Random lifts of graphs |
159
click to vote
ICDM
2008
IEEE
16 years 24 days ago
2008
IEEE
This paper studies how to incorporate side information (such as users’ feedback) in measuring node proximity on large graphs. Our method (ProSIN) is motivated by the well-studie...
272
click to vote
FOCS
1993
IEEE
15 years 10 months ago
1993
IEEE
We resolve in the a rmative a question of Boppana and Bui: whether simulated annealing can, with high probability and in polynomial time, nd the optimal bisection of a random grap...
164
click to vote
LATIN
2004
Springer
15 years 11 months ago
2004
Springer
Consider a game in which edges of a graph are provided a pair at a time, and the player selects one edge from each pair, attempting to construct a graph with a component as large ...
172
click to vote
USENIX
2007
15 years 8 months ago
2007
Random peer selection is used by numerous P2P applications; examples include application-level multicast, unstructured file sharing, and network location mapping. In most of thes...
216
click to vote
ISCA
2012
IEEE
13 years 8 months ago
2012
IEEE
—As the scales of parallel applications and platforms increase the negative impact of communication latencies on performance becomes large. Fortunately, modern High Performance C...