RSHash: a fast and space-efficient hash table for k-mers. [PDF]
Schulte-Mattler J, Reinert K.
europepmc +1 more source
Stochastic Pairwise MIS for Unbiased Large‐Kernel Reuse in Real‐Time
Abstract Spatiotemporal resampling methods such as ReSTIR decrease noise in Monte Carlo rendering of dynamic content by reusing paths across frames and pixels. Standard ReSTIR reuses spatially from a small number of randomly selected neighbors. This reuse suffers when few neighbors contain contributing samples, reducing quality toward that of the ...
Trevor Hedstrom +4 more
wiley +1 more source
A DeSci-Driven Blockchain Framework for AI-Augmented Healthcare Research. [PDF]
Singh G +6 more
europepmc +1 more source
NAADF: Globally Illuminated Voxel Worlds Accelerated with Nested Axis‐Aligned Distance Fields
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
A hybrid feature hashing approach with temporal validation for efficient forgery detection of frame duplication. [PDF]
Ali MM, Ghali NI, Hamza HM, Hosny KM.
europepmc +1 more source
BloomTree: Dynamic Coloring Techniques for Exploring Deep and Wide Tree Structures
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
Securing internet of things devices using a hybrid approach. [PDF]
Jenny RS +9 more
europepmc +1 more source
A practical algorithm for weighted k‐hulls
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
A study on a privacy preservation method for VANETs based on certificateless anonymous authentication and non-interactive zero-knowledge proof. [PDF]
Hu Z, Quan H, Ni S, He P.
europepmc +1 more source
Volumetric Inverse Rendering via Neural Radiative Transfer
Abstract Volumetric inverse rendering seeks to recover the optical properties of participating media from images. Existing approaches either rely on differentiable stochastic light transport simulation, which require substantial algorithmic effort, or use simplified models that fail to capture global illumination.
Ntumba Elie Nsampi +4 more
wiley +1 more source

