Results 11 to 20 of about 10,943 (115)
The Case for Learned Index Structures
Indexes are models: a B-Tree-Index can be seen as a model to map a key to the position of a record within a sorted array, a Hash-Index as a model to map a key to a position of a record within an unsorted array, and a BitMap-Index as a model to indicate ...
Abadi M. +12 more
core +1 more source
Fishing in the Stream: Similarity Search over Endless Data
Similarity search is the task of retrieving data items that are similar to a given query. In this paper, we introduce the time-sensitive notion of similarity search over endless data-streams (SSDS), which takes into account data quality and temporal ...
Carmel, David +2 more
core +1 more source
Variable‐Rate Texture Compression: Real‐Time Rendering with JPEG
Abstract Although variable‐rate compressed image formats such as JPEG are widely used to efficiently encode images, they have not found their way into real‐time rendering due to special requirements such as random access to individual texels. In this paper, we investigate the feasibility of variable‐rate texture compression on modern GPUs using the ...
Elias Kristmann +2 more
wiley +1 more source
Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries
We consider dictionaries of size n over the finite universe U ={0, 1}^w and introduce a new technique for their implementation: error correcting codes. The use of such codes makes it possible to replace the use of strong forms of hashing, such as universal hashing, with much weaker forms, such as clustering.<br />We use our approach to construct,
openaire +2 more sources
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
Miners' Reward Elasticity and Stability of Competing Proof‐of‐Work Cryptocurrencies
ABSTRACT Proof‐of‐Work cryptocurrencies employ miners to sustain the system through algorithmic reward adjustments. We develop a stochastic model of the multicurrency mining and identify conditions for stable transaction speeds. Bitcoin's algorithm requires hash supply elasticity <$<$1 for stability, while ASERT remains stable for any elasticity and ...
Kohei Kawaguchi +2 more
wiley +1 more source
Information-centric networking proposals attract much attention in the ongoing search for a future communication paradigm of the Internet. Replacing the host-to-host connectivity by a data-oriented publish/subscribe service eases content distribution and
Schmidt, Thomas C. +2 more
core +1 more source
Abstract The Anti‐Coercion Instrument (ACI), the most powerful tool in the EU's geoeconomic arsenal, has its origins in the first Trump US presidency and has recently been brandished again as a potential response to Trump's coercive tariffs. Its centrality to the EU's ‘geoeconomic turn’ and the twists and turns of its legislative history have been ...
Jaša Veselinovič
wiley +1 more source
Pseudo-random graphs and bit probe schemes with one-sided error
We study probabilistic bit-probe schemes for the membership problem. Given a set A of at most n elements from the universe of size m we organize such a structure that queries of type "Is x in A?" can be answered very quickly.
Romashchenko, Andrei
core +3 more sources
A Survey for Deep Reinforcement Learning Based Network Intrusion Detection
This paper surveys deep reinforcement learning (DRL) for network intrusion detection, evaluating model efficiency, minority attack detection, and dataset imbalance. Findings show DRL achieves state‐of‐the‐art results on public datasets, sometimes surpassing traditional deep learning.
Wanrong Yang +3 more
wiley +1 more source

