Sciweavers

2609 search results - page 54 / 522
» Optimizing for parallelism and data locality
Sort
View
EUROGRAPHICS
2010
Eurographics
15 years 6 months ago
Fast Ray Sorting and Breadth-First Packet Traversal for GPU Ray Tracing
We present a novel approach to ray tracing execution on commodity graphics hardware using CUDA. We decompose a standard ray tracing algorithm into several data-parallel stages tha...
Kirill Garanzha and Charles Loop
125
Voted
ML
1998
ACM
153views Machine Learning» more  ML 1998»
14 years 9 months ago
Bayesian Landmark Learning for Mobile Robot Localization
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optim...
Sebastian Thrun
BMCBI
2004
127views more  BMCBI 2004»
14 years 10 months ago
Optimized LOWESS normalization parameter selection for DNA microarray data
Background: Microarray data normalization is an important step for obtaining data that are reliable and usable for subsequent analysis. One of the most commonly utilized normaliza...
John A. Berger, Sampsa Hautaniemi, Anna-Kaarina J&...
91
Voted
PPSN
1998
Springer
15 years 2 months ago
Genetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising sim...
Günther R. Raidl, Gabriele Kodydek
97
Voted
ASPLOS
2008
ACM
15 years 5 days ago
Optimistic parallelism benefits from data partitioning
Recent studies of irregular applications such as finite-element mesh generators and data-clustering codes have shown that these applications have a generalized data parallelism ar...
Milind Kulkarni, Keshav Pingali, Ganesh Ramanaraya...