1578 search results - page 26 / 316 » Direct Routing: Algorithms and Complexity |
184
click to vote
COMCOM
2010
15 years 5 months ago
2010
: - To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position...
136
click to vote
IPPS
1994
IEEE
15 years 10 months ago
1994
IEEE
This paper describes several algorithms to perform all-to-all communication on a two-dimensional mesh connected computer with wormhole routing. We discuss both direct algorithms, ...
172
click to vote
CRYPTO
2007
Springer
16 years 20 days ago
2007
Springer
Coppersmith described at Eurocrypt 96 an algorithm for finding small roots of bivariate integer polynomial equations, based on lattice reduction. A simpler algorithm was later pro...
164
click to vote
SIGCOMM
2006
ACM
16 years 13 days ago
2006
ACM
Traditional studies of routing problems often assumed strict preferences on paths, by eliminating ambiguity in path comparisons, or imposing a priori deterministic tie-breaking. S...
205
click to vote
ATAL
2007
Springer
15 years 10 months ago
2007
Springer
The dominant existing routing strategies employed in peerto-peer(P2P) based information retrieval(IR) systems are similarity-based approaches. In these approaches, agents depend o...