Sciweavers

1594 search results - page 269 / 319
» Fast Prediction on a Tree
Sort
View
CLUSTER
2006
IEEE
14 years 1 months ago
Modeling Network Contention Effects on All-to-All Operations
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient complete exchange ...
Luiz Angelo Steffenel
PAKDD
2000
ACM
161views Data Mining» more  PAKDD 2000»
14 years 1 months ago
Adaptive Boosting for Spatial Functions with Unstable Driving Attributes
Combining multiple global models (e.g. back-propagation based neural networks) is an effective technique for improving classification accuracy by reducing a variance through manipu...
Aleksandar Lazarevic, Tim Fiez, Zoran Obradovic
ARCS
2008
Springer
13 years 11 months ago
An Optimized ZGEMM Implementation for the Cell BE
: The architecture of the IBM Cell BE processor represents a new approach for designing CPUs. The fast execution of legacy software has to stand back in order to achieve very high ...
Timo Schneider, Torsten Hoefler, Simon Wunderlich,...
ASPDAC
2005
ACM
133views Hardware» more  ASPDAC 2005»
13 years 11 months ago
A novel O(n) parallel banker's algorithm for System-on-a-Chip
This paper proposes a novel O(n) Parallel Banker’s Algorithm (PBA) with a best-case run-time of O(1), reduced from an ¢¤£¦¥¨§© run-time complexity of the original Ban...
Jaehwan John Lee, Vincent John Mooney III
ESA
2008
Springer
112views Algorithms» more  ESA 2008»
13 years 11 months ago
Time-Dependent SHARC-Routing
In recent years, many speed-up techniques for Dijkstra's algorithm have been developed that make the computation of shortest paths in static road networks a matter of microse...
Daniel Delling