Results 71 to 80 of about 917,412 (232)
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold improvement in speed over direct methods based on degree 3 polynomials.
M. Thorup, Yin Zhang
semanticscholar +1 more source
Software Performance of Universal Hash Functions [PDF]
This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toeplitz hashing, division hashing, evaluation hashing, and MMH hashing. An objective comparison between these widely varying approaches is achieved by defining constructions that offer a ...
Bart Preneel, Wim Nevelsteen
openaire +2 more sources
3DGS.zip: A survey on 3D Gaussian Splatting Compression Methods
Abstract 3D Gaussian Splatting (3DGS) has emerged as a cutting‐edge technique for real‐time radiance field rendering, offering state‐of‐the‐art performance in terms of both quality and speed. 3DGS models a scene as a collection of three‐dimensional Gaussians, with additional attributes optimized to conform to the scene's geometric and visual properties.
M. T. Bagdasarian+6 more
wiley +1 more source
Random Access Segmentation Volume Compression for Interactive Volume Rendering
Abstract Segmentation volumes are voxel data sets often used in machine learning, connectomics, and natural sciences. Their large sizes make compression indispensable for storage and processing, including GPU video memory constrained real‐time visualization.
M. Piochowiak+2 more
wiley +1 more source
Abstract The tope (Galeorhinus galeus, Linnaeus, 1758) is a critically endangered shark, which, like numerous elasmobranchs, faces severe global decline. There are, however, substantial disparities between this species' global conservation status and those of some local populations, with the Northeast Atlantic representing a relative stronghold for ...
Luke W. J. Cameron+5 more
wiley +1 more source
Fast Locality-Sensitive Hashing Frameworks for Approximate Near Neighbor Search
The Indyk-Motwani Locality-Sensitive Hashing (LSH) framework (STOC 1998) is a general technique for constructing a data structure to answer approximate near neighbor queries by using a distribution $\mathcal{H}$ over locality-sensitive hash functions ...
A Andoni+12 more
core +1 more source
ABSTRACT We perform bibliometric analysis on documents for 255 Regulatory Impact Analyzes (RIAs) prepared by the US Environmental Protection Agency (EPA) from 1980 through 2024. Using a series of automated information extraction methods, we extract references from these documents and match them to bibliographic records.
Tyler A. Scott, Sojeong Kim, Liza Wood
wiley +1 more source
Abstract As people age, there is a natural decline in cognitive functioning and brain structure. However, the relationship between brain function and cognition in older adults is neither straightforward nor uniform. Instead, it is complex, influenced by multiple factors, and can vary considerably from one person to another.
Monica Baciu, Elise Roger
wiley +1 more source
On Symmetric and Asymmetric LSHs for Inner Product Search [PDF]
We consider the problem of designing locality sensitive hashes (LSH) for inner product similarity, and of the power of asymmetric hashes in this context.
Neyshabur, Behnam, Srebro, Nathan
core
Maximization of Extractable Randomness in a Quantum Random-Number Generator
The generation of random numbers via quantum processes is an efficient and reliable method to obtain true indeterministic random numbers that are of vital importance to cryptographic communication and large-scale computer modeling.
Assad, S. M.+6 more
core +1 more source