Sciweavers

5184 search results - page 14 / 1037
» The digital divide of computing
Sort
View
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
124
Voted
VLUDS
2010
212views Visualization» more  VLUDS 2010»
14 years 4 months ago
Open Problems in Computational Steering of Massive Parallel Unstructured Grid Based CFD Simulations
Traditionally, analysis of flow fields resulting from computational fluid dynamics (CFD) calculations is a sequential process. The flow area defined by surrounding geometry is tes...
Christian Wagner
CVPR
2006
IEEE
15 years 11 months ago
Spatial Divide and Conquer with Motion Cues for Tracking through Clutter
Tracking can be considered a two-class classification problem between the foreground object and its surrounding background. Feature selection to better discriminate object from ba...
Zhaozheng Yin, Robert T. Collins
78
Voted
PG
2002
IEEE
15 years 2 months ago
A Divide and Conquer Algorithm for Triangle Mesh Connectivity Encoding
We propose a divide and conquer algorithm for the single resolution encoding of triangle mesh connectivity. Starting from a boundary edge we grow a zig-zag strip which divides the...
Ioannis P. Ivrissimtzis, Christian Rössl, Han...
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