Sciweavers

CG
2007
Springer
13 years 4 months ago
A fast all nearest neighbor algorithm for applications involving large point-clouds
Algorithms that use point-cloud models make heavy use of the neighborhoods of the points. These neighborhoods are used to compute the surface normals for each point, mollificatio...
Jagan Sankaranarayanan, Hanan Samet, Amitabh Varsh...
EUROPAR
2010
Springer
13 years 4 months ago
Optimized On-Chip-Pipelined Mergesort on the Cell/B.E
Abstract. Limited bandwidth to off-chip main memory is a performance bottleneck in chip multiprocessors for streaming computations, such as Cell/B.E., and this will become even mor...
Rikard Hultén, Christoph W. Kessler, Jö...
CIDR
2009
98views Algorithms» more  CIDR 2009»
13 years 5 months ago
From Declarative Languages to Declarative Processing in Computer Games
Recent work has shown that we can dramatically improve the performance of computer games and simulations through declarative processing: Character AI can be written in an imperati...
Ben Sowell, Alan J. Demers, Johannes Gehrke, Nitin...
APVIS
2007
13 years 5 months ago
Adaptive sampling in three dimensions for volume rendering on GPUs
Direct volume rendering of large volumetric data sets on programmable graphics hardware is often limited by the amount of available graphics memory and the bandwidth from main mem...
Martin Kraus, Magnus Strengert, Thomas Klein, Thom...
SIGMOD
1991
ACM
104views Database» more  SIGMOD 1991»
13 years 7 months ago
Managing Persistent Objects in a Multi-Level Store
This paper presents an architecture for a persistent object store in which multi-level storage is explicitly included. Traditionally, DBMSs have assumed that all accessible data r...
Michael Stonebraker
EDBT
1992
ACM
111views Database» more  EDBT 1992»
13 years 7 months ago
Pipelined Query Processing in the DBGraph Storage Model
The DBGraph storage model, designed for main memory DBMS, ensures both data storage compactness and efficient processing for all database operations. By representing the entire da...
Philippe Pucheral, Jean-Marc Thévenin
ICPP
1995
IEEE
13 years 8 months ago
Data-Parallel Primitives for Spatial Operations
Data-parallel primitives for performing operations on the PM1 quadtree and the bucket PMR quadtree are presented using the scan model. Algorithms are described for building these ...
Erik G. Hoel, Hanan Samet
EDBT
2006
ACM
154views Database» more  EDBT 2006»
13 years 8 months ago
Approximation Techniques to Enable Dimensionality Reduction for Voronoi-Based Nearest Neighbor Search
Utilizing spatial index structures on secondary memory for nearest neighbor search in high-dimensional data spaces has been the subject of much research. With the potential to host...
Christoph Brochhaus, Marc Wichterich, Thomas Seidl
CF
2006
ACM
13 years 8 months ago
An efficient cache design for scalable glueless shared-memory multiprocessors
Traditionally, cache coherence in large-scale shared-memory multiprocessors has been ensured by means of a distributed directory structure stored in main memory. In this way, the ...
Alberto Ros, Manuel E. Acacio, José M. Garc...
HOTOS
2009
IEEE
13 years 8 months ago
Operating System Support for NVM+DRAM Hybrid Main Memory
:
Jeffrey C. Mogul, Eduardo Argollo, Mehul A. Shah, ...