Results 151 to 160 of about 1,534,598 (250)

Accelerating Hash-Based Query Processing Operations on FPGAs by a Hash Table Caching Technique

open access: yes
Extracting valuable information from the rapidly growing field of Big Data faces serious performance constraints, especially in the software-based database management systems (DBMS).
Salami, Behzad   +4 more
core  

NAADF: Globally Illuminated Voxel Worlds Accelerated with Nested Axis‐Aligned Distance Fields

open access: yesComputer Graphics Forum, EarlyView.
Abstract Achieving realistic rendering of 3D scenes in real time using path tracing is challenging due to the high sample count required, with ray tracing as the bottleneck. Focusing on voxels as a geometry representation offers significant opportunities for optimizations, especially for tracing the rays, but also for computing the samples.
A. Ulschmid   +4 more
wiley   +1 more source

Goode Hash works with broomcorn stalks

open access: yes
Goode Hash sits on a chair outside in front of a woodpile. Stalks of broomcorn lay across his lap.
Hash, Goode
core  

BloomTree: Dynamic Coloring Techniques for Exploring Deep and Wide Tree Structures

open access: yesComputer Graphics Forum, EarlyView.
Abstract This study introduces BloomTree, an interactive Sunburst system for visualizing massive hierarchical datasets, such as the Tree of Life. Traditional static color schemes fail to maintain perceptual distinguishability when applied to millions of nodes, and managing the full tree in memory is computationally costly.
A. Tanaka, K. Wakita
wiley   +1 more source

Goode Hash ties handle of broomcorn broom

open access: yes
Goode Hash sits in a chair in front of a fireplace, tying stalks of broomcorn together to make a broom.
Hash, Goode
core  

A practical algorithm for weighted k‐hulls

open access: yesComputer Graphics Forum, EarlyView.
Abstract The convex hull is a central concept in computational geometry, geometry processing, and generally for summarizing sampled data. Its descriptive power suffers significantly in the presence of noise. The k‐hull, also known as the k‐depth contour in statistics, is the intersection of all half‐spaces that contain all but k data points, i.e. it is
N. Look, H. Meyer, M. Alexa
wiley   +1 more source

Home - About - Disclaimer - Privacy