573 search results - page 69 / 115 » Parallel Algorithms for Dandelion-Like Codes |
FOAL
2009
ACM
14 years 1 months ago
2009
ACM
Aspect-oriented programming (AOP) promises to localize concerns that inherently crosscut the primary structural decomposition of a software system. Localization of concerns is cri...
CCGRID
2003
IEEE
14 years 21 days ago
2003
IEEE
Fixed-parameter tractability (FPT) techniques have recently been successful in solving NP-complete problem instances of practical importance which were too large to be solved with...
CVPR
2011
IEEE
13 years 2 months ago
2011
IEEE
We present the design and implementation of new inexact Newton type Bundle Adjustment algorithms that exploit hardware parallelism for efficiently solving large scale 3D scene re...
POPL
1998
ACM
13 years 11 months ago
1998
ACM
Memory expansions are classical means to extract parallelism from imperative programs. However, for dynamic control programs with general memory accesses, such transformations eit...
IPPS
1995
IEEE
13 years 11 months ago
1995
IEEE
Current research in parallel programming is focused on closing the gap between globally indexed algorithms and the separate address spaces of processors on distributed memory mult...