2079 search results - page 130 / 416 » Universality of random graphs |
123
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We study the properties of affine rigidity of a (hyper)graph and prove a variety of fundamental results. First, we show that affine rigidity is a generic property (i.e., only depen...
170
click to vote
APPT
2009
Springer
15 years 2 months ago
2009
Springer
Abstract. In this paper, we propose a universal network, called recursive dual-net (RDN). It can be used as a candidate of effective interconnection networks for massively parallel...
179
click to vote
ISCA
2012
IEEE
13 years 7 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...
124
click to vote
SODA
2003
ACM
15 years 6 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
130
click to vote
CORR
2002
Springer
15 years 4 months ago
2002
Springer
We show that the hitting time of the discrete time quantum random walk on the n-bit hypercube from one corner to its opposite is polynomial in n. This gives the first exponential ...