2609 search results - page 110 / 522 » Optimizing for parallelism and data locality |
COMPGEOM
2003
ACM
15 years 6 months ago
2003
ACM
In this paper we describe and analyze a method based on local least square fitting for estimating the normals at all sample points of a point cloud data (PCD) set, in the presenc...
108
Voted
SODA
2008
ACM
15 years 2 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
108
Voted
IPPS
1997
IEEE
15 years 4 months ago
1997
IEEE
The n-dimensional grid is one of the most representative patterns of data flow in parallel computation. The most frequently used scheduling models for grids is the unit execution ...
ISAAC
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The Parallel Disks Model (PDM) has been proposed to alleviate the I/O bottleneck that arises in the processing of massive data sets. Sorting has been extensively studied ...
86
Voted
CLADE
2003
IEEE
15 years 6 months ago
2003
IEEE
The Grid community is actively working on defining, deploying and standardizing protocols, mechanisms, and infrastructure to support decentralized, seamless, and secure interacti...