725 search results - page 130 / 145 » Bounding Degrees on RPL |
TPDS
1998
14 years 11 months ago
1998
—One of the main obstacles in obtaining high performance from message-passing multicomputer systems is the inevitable communication overhead which is incurred when tasks executin...
SODA
2010
ACM
14 years 10 months ago
2010
ACM
We consider the following marking process (rw-rand) made by a random walk on an undirected graph G. Upon arrival at a vertex v, it marks v if unmarked and otherwise it marks a ran...
ISVD
2010
IEEE
14 years 9 months ago
2010
IEEE
—In this paper, we present a Delaunay refinement algorithm for meshing 3D medical images. We prove that (a) all the tetrahedra of the output mesh have radius-edge ratio less tha...
RSA
2010
14 years 9 months ago
2010
The 2-dimensional Hamming graph H(2, n) consists of the n2 vertices (i, j), 1 ≤ i, j ≤ n, two vertices being adjacent when they share a common coordinate. We examine random sub...
VTC
2010
IEEE
14 years 9 months ago
2010
IEEE
—We present the ǫ-outage capacity in the low signal-to-noise ratio (SNR) regime of an incremental relaying network. The network consists of one source, one destination, and two ...