Sciweavers

249 search results - page 18 / 50
» Approximating the Bandwidth of Caterpillars
Sort
View
LCN
1999
IEEE
14 years 27 days ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
MICRO
1995
IEEE
97views Hardware» more  MICRO 1995»
14 years 5 days ago
Improving CISC instruction decoding performance using a fill unit
Current superscalar processors, both RISC and CISC, require substantial instruction fetch and decode bandwidth to keep multiple functional units utilized. While CISC instructions ...
Mark Smotherman, Manoj Franklin
EUROPAR
2008
Springer
13 years 10 months ago
Optimized Pipelined Parallel Merge Sort on the Cell BE
Chip multiprocessors designed for streaming applications such as Cell BE offer impressive peak performance but suffer from limited bandwidth to offchip main memory. As the number o...
Jörg Keller, Christoph W. Kessler
SDM
2008
SIAM
118views Data Mining» more  SDM 2008»
13 years 10 months ago
Massive-Scale Kernel Discriminant Analysis: Mining for Quasars
We describe a fast algorithm for kernel discriminant analysis, empirically demonstrating asymptotic speed-up over the previous best approach. We achieve this with a new pattern of...
Ryan Riegel, Alexander Gray, Gordon Richards
NETWORKING
2007
13 years 10 months ago
Interference-Aware Multicasting in Wireless Mesh Networks
Multicasting is one of the most important applications in Wireless Ad hoc Networks and the currently emerging Wireless Mesh Networks. In such networks, interference due to the shar...
Sudheendra Murthy, Abhishek Goswami, Arunabha Sen