400 search results - page 29 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
ICPR
2010
IEEE
15 years 5 months ago
2010
IEEE
We propose to use energy minimization in MRFs for matching-based image recognition tasks. To this end, the Tree-Reweighted Message Passing algorithm is modified by geometric cons...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
We consider technology mapping from factored form binary leaf-DAG to lookup tables LUTs , such as those found in eld programmable gate arrays. Polynomial time algorithms exist f...
ECCC
2000
14 years 11 months ago
2000
We consider the problem of Scheduling n Independent Jobs on m Unrelated Parallel Machines, when the number of machines m is xed. We address the standard problem of minimizing the ...
103
click to vote
PPOPP
2010
ACM
15 years 9 months ago
2010
ACM
Exploiting the emerging reality of affordable multi-core architeces through providing programmers with simple abstractions that would enable them to easily turn their sequential p...
IPPS
1999
IEEE
15 years 4 months ago
1999
IEEE
Clustering and scheduling of tasks for parallel implementation is a well researched problem. Several techniques have been presented in the literature to improve performance and re...