Results 101 to 110 of about 91,922 (250)
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
Vehicle Communication using Hash Chain-based Secure Cluster [PDF]
We introduce a hash chain-based secure cluster. Here, secure cluster refers to a set of vehicles having vehicular secrecy capacity of more than a reference value. Since vehicle communication is performed in such a secure cluster, basically secure vehicle communication can be expected.
arxiv
khmer: Working with Big Data in Bioinformatics [PDF]
We introduce design and optimization considerations for the 'khmer' package.Comment: Invited chapter for forthcoming book on Performance of Open Source ...
Brown, C. Titus, McDonald, Eric
core
Generalized Hash Chain Traversal with Selective Output
A hash chain H for a one-way hash function h(·) is a sequence of hash values , where v0 is a public value, vn a secret value, and vi =h(vi+1). A hash chain traversal algorithm T computes and outputs the hash chain H, returning vi in time period (called round) i for 1 ≤ i ≤ n.
Yum, DH, Seo, JW, Cho, K, Lee, PJ
openaire +4 more sources
Motivating Content Sharing and Trustworthiness in Mobile Social Networks
Mobile social networks (MSNs) enable users to discover and share contents with each other, especially at ephemeral events such as exhibitions and conferences where users could be strangers.
Fredrick Mzee Awuor+2 more
doaj +1 more source
Binary Pebbling Algorithms for In-Place Reversal of One-Way Hash Chains [PDF]
We present optimal binary pebbling algorithms for in-place reversal (backward traversal) of one-way hash chains. For a hash chain of length $2^k$, the number of hashes performed in each output round does not exceed $\lceil k/2 \rceil$, whereas the number of hash values stored (pebbles) throughout is at most $k$.
arxiv
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
Linear Hashing is Awesome [PDF]
We consider the hash function $h(x) = ((ax+b) \bmod p) \bmod n$ where $a,b$ are chosen uniformly at random from $\{0,1,\ldots,p-1\}$. We prove that when we use $h(x)$ in hashing with chaining to insert $n$ elements into a table of size $n$ the expected length of the longest chain is $\tilde{O}\!\left(n^{1/3}\right)$.
arxiv
Abstract This paper contributes to the understanding of the complex relationship between British economic performance during the Napoleonic wars and the ‘West Indies’, as the Caribbean slave colonies were called. Not only did profits from slave‐based commerce provide financing for the growth of the financial sector, as has been claimed, but the risk of
Carolyn Sissoko, Mina Ishizu
wiley +1 more source
Multi-Dimensional Hash Chains and Application to Micropayment Schemes [PDF]
One-way hash chains have been used in many micropayment schemes due to their simplicity and efficiency. In this paper we introduce the notion of multi-dimensional hash chains, which is a new generalization of traditional one-way hash chains. We show that this construction has storage-computational complexity of O(logN) per chain element, which is ...
openaire +3 more sources