Sciweavers

6437 search results - page 315 / 1288
» Parallel Algorithms for Arrangements
Sort
View
RSS
2007
126views Robotics» more  RSS 2007»
15 years 5 months ago
Automatic Scheduling for Parallel Forward Dynamics Computation of Open Kinematic Chains
— Recent progress in the algorithm as well as the processor power have made the dynamics simulation of complex kinematic chains more realistic in various fields such as human mo...
Katsu Yamane, Yoshihiko Nakamura
148
Voted
PPOPP
2012
ACM
13 years 11 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
CLUSTER
2009
IEEE
15 years 10 months ago
Accelerating SIFT on parallel architectures
Abstract—SIFT is a widely-used algorithm that extracts features from images; using it to extract information from hundreds of terabytes of aerial and satellite photographs requir...
Seth Warn, Wesley Emeneker, Jackson Cothren, Amy W...

Publication
189views
15 years 8 months ago
Direct Send Compositing for Parallel Sort-Last Rendering
In contrast to sort-first, sort-last parallel rendering has the distinct advantage that the task division for parallel geometry processing and rasterization is simple, and can eas...
Stefan Eilemann, Renato Pajarola
AMAST
2006
Springer
15 years 7 months ago
Reasoning About Data-Parallel Pointer Programs in a Modal Extension of Separation Logic
This paper proposes a modal extension of Separation Logic [8, 11] for reasoning about data-parallel programs that manipulate heap allocated linked data structures. Separation Logi...
Susumu Nishimura