Sciweavers

1972 search results - page 63 / 395
» connection 2008
Sort
View
TPDS
2010
109views more  TPDS 2010»
13 years 6 months ago
Minimal Sets of Turns for Breaking Cycles in Graphs Modeling Networks
Abstract—We propose an algorithm that provides for deadlockfree and livelock-free routing, in particular in wormhole routed networks. The proposed algorithm requires nearly minim...
Lev B. Levitin, Mark G. Karpovsky, Mehmet Mustafa
DM
1998
56views more  DM 1998»
13 years 8 months ago
Factoring cardinal product graphs in polynomial time
In this paper a polynomial algorithm for the prime factorization of finite, connected nonbipartite graphs with respect to the cardinal product is presented. This algorithm also d...
Wilfried Imrich
CORR
2008
Springer
123views Education» more  CORR 2008»
13 years 8 months ago
High Density Through Silicon Via (TSV)
The Through Silicon Via (TSV) process developed by Silex provides down to 30
Magnus Rimskog, Tomas Bauer
QUESTA
2008
107views more  QUESTA 2008»
13 years 8 months ago
Queues where customers of one queue act as servers of the other queue
We consider a system comprised of two connected M/M/
Efrat Perel, Uri Yechiali
CACM
1999
138views more  CACM 1999»
13 years 8 months ago
Onion Routing
Onion Routing is an infrastructure for private communication over a public network. It provides anonymous connections that are strongly resistant to both eavesdropping and tra c a...
David M. Goldschlag, Michael G. Reed, Paul F. Syve...