332 search results - page 29 / 67 » Hypercubic Sorting Networks |
ICA3PP
2009
Springer
14 years 9 days ago
2009
Springer
In this paper, we propose a new universal network, called recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers with very large scal...
SPAA
1994
ACM
13 years 11 months ago
1994
ACM
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
INFOCOM
2012
IEEE
11 years 10 months ago
2012
IEEE
—This paper discusses a way to communicate without relying on fixed infrastructure at some central hub. This can be useful for bootstrapping loosely connected peer-to-peer syste...
STOC
1993
ACM
13 years 11 months ago
1993
ACM
We consider a class of routing problems on connected graphs G. Initially, each vertex v of G is occupied by a “pebble” which has a unique destination π(v) in G (so that π is...
SIP
2001
13 years 9 months ago
2001
Marching Ridges is an algorithm for finding ridges of measurement functions defined for images, in which the ridges are defined as level sets of first derivatives of the measureme...