Sciweavers

417 search results - page 15 / 84
» Running Time Predictions for Factoring Algorithms
Sort
View
ICPPW
2005
IEEE
15 years 3 months ago
A Practical Approach to the Rating of Barrier Algorithms Using the LogP Model and Open MPI
Large–scale parallel applications performing global synchronization may spend a significant amount of execution time waiting for the completion of a barrier operation. Conseque...
Torsten Hoefler, Lavinio Cerquetti, Torsten Mehlan...
POPL
1994
ACM
15 years 1 months ago
Reducing Indirect Function call Overhead in C++ Programs
Modern computer architectures increasingly depend on mechanisms that estimate future control flow decisions to increase performance. Mechanisms such as speculative execution and p...
Brad Calder, Dirk Grunwald
CSREAESA
2003
14 years 11 months ago
Static Pattern Predictor (SPP) Based Low Power Instruction Cache Design
Energy dissipation in cache memories is becoming a major design issue in embedded microprocessors. Predictive filter cache based instruction cache hierarchy is effective in reduci...
Kugan Vivekanandarajah, Thambipillai Srikanthan, C...
95
Voted
BMCBI
2004
150views more  BMCBI 2004»
14 years 9 months ago
Cross-species comparison significantly improves genome-wide prediction of cis-regulatory modules in Drosophila
Background: The discovery of cis-regulatory modules in metazoan genomes is crucial for understanding the connection between genes and organism diversity. It is important to quanti...
Saurabh Sinha, Mark D. Schroeder, Ulrich Unnerstal...
DMIN
2006
143views Data Mining» more  DMIN 2006»
14 years 11 months ago
Reverse Tree Clustering
Common document clustering algorithms utilize models that either divide a corpus into smaller clusters or gather individual documents into clusters. Hierarchical Agglomerative Clus...
Casey Bartman, Jamal R. Alsabbagh