Sciweavers

605 search results - page 6 / 121
» Reducing complexity in tree-like computer interconnection ne...
Sort
View
PC
2000
96views Management» more  PC 2000»
13 years 7 months ago
Multicast communication in wormhole-routed star graph interconnection networks
Multicast, an important communication mechanism, is frequently applied in parallel computing. The star graph interconnection network, when compared with the hypercube network, bei...
Tzung-Shi Chen, Neng-Chung Wang, Chih-Ping Chu
BMCBI
2005
156views more  BMCBI 2005»
13 years 7 months ago
A new dynamical layout algorithm for complex biochemical reaction networks
Background: To study complex biochemical reaction networks in living cells researchers more and more rely on databases and computational methods. In order to facilitate computatio...
Katja Wegner, Ursula Kummer
SLIP
2004
ACM
14 years 27 days ago
Optical solutions for system-level interconnect
Throughput, power consumption, signal integrity, pin count and routing complexity are all increasingly important interconnect issues that the system designer must deal with. Recen...
Ian O'Connor
AAAI
2008
13 years 9 months ago
Reducing Particle Filtering Complexity for 3D Motion Capture using Dynamic Bayesian Networks
Particle filtering algorithms can be used for the monitoring of dynamic systems with continuous state variables and without any constraints on the form of the probability distribu...
Cédric Rose, Jamal Saboune, François...
CNSR
2008
IEEE
136views Communications» more  CNSR 2008»
14 years 1 months ago
Using QR-Updating with Reduced Complexity for Precise Localization in Mobile Sensor Networks
Localizing tiny sensor nodes in large wireless sensor networks is extremely complex, due to the node’s strict resource limitations regarding memory size, processor performance a...
Frank Reichenbach, Dominik Lieckfeldt, Dirk Timmer...