Results 81 to 90 of about 2,163,207 (263)

Fast and Powerful Hashing using Tabulation [PDF]

arXiv, 2015
Randomized algorithms are often enjoyed for their simplicity, but the hash functions employed to yield the desired probabilistic guarantees are often too complicated to be practical. Here we survey recent results on how simple hashing schemes based on tabulation provide unexpectedly strong guarantees.
arxiv  

Efficient Perspective‐Correct 3D Gaussian Splatting Using Hybrid Transparency

Computer Graphics Forum, EarlyView.
Abstract 3D Gaussian Splats (3DGS) have proven a versatile rendering primitive, both for inverse rendering as well as real‐time exploration of scenes. In these applications, coherence across camera frames and multiple views is crucial, be it for robust convergence of a scene reconstruction or for artifact‐free fly‐throughs.
Florian Hahlbohm, Fabian Friederichs, Tim Weyrich, Linus Franke, Moritz Kappel, Susana Castillo, Marc Stamminger, Martin Eisemann, Marcus Magnor   +8 more
wiley   +1 more source

D‐NPC: Dynamic Neural Point Clouds for Non‐Rigid View Synthesis from Monocular Video

Computer Graphics Forum, EarlyView.
Abstract Dynamic reconstruction and spatiotemporal novel‐view synthesis of non‐rigidly deforming scenes recently gained increased attention. While existing work achieves impressive quality and performance on multi‐view or teleporting camera setups, most methods fail to efficiently and faithfully recover motion and appearance from casual monocular ...
Moritz Kappel, Florian Hahlbohm, Timon Scholz, Susana Castillo, Christian Theobalt, Martin Eisemann, Vladislav Golyanik, Marcus Magnor   +7 more
wiley   +1 more source

Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries

, 2017
We present the first thorough practical study of the Lempel-Ziv-78 and the Lempel-Ziv-Welch computation based on trie data structures. With a careful selection of trie representations we can beat well-tuned popular trie data structures like Judy, m ...
A Poyias, D Arroyuelo, D Lemire, D Lemire, D Lemire, G Marsaglia, GH Gonnet, H Bannai, H Luan, J Fischer, J Fischer, J Jansson, J Kärkkäinen, J Ziv, J Ziv, JA Feldman, JG Cleary, K Chung, L Carter, P Tchebychev, RM Karp, RM Robinson, TA Welch, Y Nakashima   +23 more
core   +1 more source

Authentication Using Piggy Bank Approach to Secure Double-Lock Cryptography [PDF]

arXiv, 2014
The piggy bank idea allows one-way encryption of information that can be accessed only by authorized parties. Here we show how the piggy bank idea can be used to authenticate parties to counter man-in-the-middle (MIM) attack that can jeopardize the double-lock cryptography protocol.
arxiv  

Real‐Time Rendering Framework for Holography

Computer Graphics Forum, EarlyView.
Abstract With the advent of holographic near‐eye displays, the need for rendering algorithms that output holograms instead of color images emerged. These holograms usually encode phase maps that alter the phase of coherent light sources such that images result from diffraction effects.
Sascha Fricke, Susana Castillo, Martin Eisemann, Marcus Magnor   +3 more
wiley   +1 more source

Hashing for Similarity Search: A Survey [PDF]

, 2014
Similarity search (nearest neighbor search) is a problem of pursuing the data items whose distances to a query item are the smallest from a large database.
Ji, Jianqiu, Shen, Heng Tao, Song, Jingkuan, Wang, Jingdong   +3 more
core  

Estimation of Miner Hash Rates and Consensus on Blockchains (draft) [PDF]

arXiv, 2017
We make several contributions that quantify the real-time hash rate and therefore the consensus of a blockchain. We show that by using only the hash value of blocks, we can estimate and measure the hash rate of all miners or individual miners, with quanti able accuracy.
arxiv  

Random Access Segmentation Volume Compression for Interactive Volume Rendering

Computer Graphics Forum, EarlyView.
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, F. Kurpicz, C. Dachsbacher   +2 more
wiley   +1 more source

Dynamic Space Efficient Hashing [PDF]

arXiv, 2017
We consider space efficient hash tables that can grow and shrink dynamically and are always highly space efficient, i.e., their space consumption is always close to the lower bound even while growing and when taking into account storage that is only needed temporarily. None of the traditionally used hash tables have this property.
arxiv