Sciweavers

11381 search results - page 483 / 2277
» Connectivity
Sort
View
IWANN
1997
Springer
15 years 11 months ago
A Fast Kohonen Net Implementation for Spert-II
We present an implementation of Kohonen Self-Organizing Feature Maps for the Spert-II vector microprocessor system. The implementation supports arbitrary neural map topologies and ...
Krste Asanovic
MICRO
1994
IEEE
81views Hardware» more  MICRO 1994»
15 years 11 months ago
Register file port requirements of transport triggered architectures
Exploitation of large amounts of instruction level parallelism requires a large amount of connectivity between the shared register file and the function units; this connectivity i...
Jan Hoogerbrugge, Henk Corporaal
STOC
1993
ACM
109views Algorithms» more  STOC 1993»
15 years 11 months ago
Routing permutations on graphs via matchings
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...
Noga Alon, Fan R. K. Chung, Ronald L. Graham
STOC
1993
ACM
76views Algorithms» more  STOC 1993»
15 years 11 months ago
Piecewise linear paths among convex obstacles
Let B be a set of n arbitrary possibly intersecting convex obstacles in Rd. It is shown that any two points which can be connected by a path avoiding the obstacles can also be c...
Mark de Berg, Jirí Matousek, Otfried Schwar...
SIGCOMM
1992
ACM
15 years 11 months ago
Internet Routing Over Large Public Data Networks Using Shortcuts
With the emergence of large switched public data networks that are well-suited to connectionless internets, for instance SMDS, it is possible that larger and larger numbers of int...
Paul F. Tsuchiya