Sciweavers

3 search results - page 1 / 1
» Recursion Unrolling for Divide and Conquer Programs
Sort
View
67
Voted
LCPC
2000
Springer
15 years 1 months ago
Recursion Unrolling for Divide and Conquer Programs
This paper presents recursion unrolling, a technique for improving the performance of recursive computations. Conceptually, recursion unrolling inlines recursive calls to reduce c...
Radu Rugina, Martin C. Rinard
89
Voted
PPOPP
1999
ACM
15 years 1 months ago
Automatic Parallelization of Divide and Conquer Algorithms
Divide and conquer algorithms are a good match for modern parallel machines: they tend to have large amounts of inherent parallelism and they work well with caches and deep memory...
Radu Rugina, Martin C. Rinard
85
Voted
KDD
2009
ACM
175views Data Mining» more  KDD 2009»
15 years 2 months ago
Multi-class protein fold recognition using large margin logic based divide and conquer learning
Inductive Logic Programming (ILP) systems have been successfully applied to solve complex problems in bioinformatics by viewing them as binary classification tasks. It remains an...
Huma Lodhi, Stephen Muggleton, Michael J. E. Stern...