400 search results - page 61 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
76
Voted
IEEEPACT
2006
IEEE
15 years 3 months ago
2006
IEEE
A recent trend in computing are domain-specific program generators, designed to alleviate the effort of porting and reoptimizing libraries for fast-changing and increasingly com...
96
Voted
SOFSEM
2000
Springer
15 years 1 months ago
2000
Springer
For half a century since computers came into existence, the goal of finding elegant and efficient algorithms to solve "simple" (welldefined and well-structured) problems ...
WADS
2007
Springer
15 years 3 months ago
2007
Springer
While standard parallel machine scheduling is concerned with good assignments of jobs to machines, we aim to understand how the quality of an assignment is affected if the jobs’...
SDM
2008
SIAM
14 years 11 months ago
2008
SIAM
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...
99
Voted
CP
2008
Springer
14 years 11 months ago
2008
Springer
Modern computer architectures have complex features that can only be fully taken advantage of if the compiler schedules the compiled code. A standard region of code for scheduling ...