Results 51 to 60 of about 20,415 (157)

Cache-Oblivious Peeling of Random Hypergraphs

, 2013
The computation of a peeling order in a randomly generated hypergraph is the most time-consuming step in a number of constructions, such as perfect hashing schemes, random $r$-SAT solvers, error-correcting codes, and approximate set encodings.
Belazzougui, Djamal, Boldi, Paolo, Ottaviano, Giuseppe, Venturini, Rossano, Vigna, Sebastiano   +4 more
core   +1 more source

Linear-scaling and parallelizable algorithms for stochastic quantum chemistry

, 2013
For many decades, quantum chemical method development has been dominated by algorithms which involve increasingly complex series of tensor contractions over one-electron orbital spaces.
Alavi, Ali, Booth, George H., Smart, Simon D.   +2 more
core   +1 more source

Quantum Channel Capacity of Very Noisy Channels

, 1998
We present a family of additive quantum error-correcting codes whose capacities exceeds that of quantum random coding (hashing) for very noisy channels. These codes provide non-zero capacity in a depolarizing channel for fidelity parameters $f$ when $f> .
A. Ekert, A. M. Steane, A. M. Steane, A. R. Calderbank, A. R. Calderbank, B. Schumacher, B. Schumacher, C. E. Shannon, C. E. Shannon, C. H. Bennett, C. H. Bennett, C. H. Bennett, C. H. Bennett, D. Gottesman, D. P. DiVincenzo, D. W. Leung, David P. DiVincenzo, E. Knill, E. M. Rains, John A. Smolin, P. W. Shor, P. W. Shor, Peter W. Shor, R. Cleve, R. Jozsa, R. Laflamme, S. Lloyd   +26 more
core   +2 more sources

On the Phase Space of Block-Hiding Strategies in Bitcoin-like networks [PDF]

, 2014
We calculate the probability of success of block-hiding mining strategies in Bitcoin-like networks. These strategies involve building a secret branch of the block-tree and publishing it opportunistically, aiming to replace the top of the main branch and ...
Shomer, Assaf
core   +1 more source

Complexity analysis and performance of double hashing sort algorithm [PDF]

Journal of the Egyptian Mathematical Society, 2019
Sorting an array of n elements represents one of the leading problems in different fields of computer science such as databases, graphs, computational geometry, and bioinformatics. A large number of sorting algorithms have been proposed based on different strategies. Recently, a sequential algorithm, called double hashing sort (DHS) algorithm, has been
openaire   +2 more sources

In-packet Bloom filters: Design and networking applications

, 2010
The Bloom filter (BF) is a well-known space-efficient data structure that answers set membership queries with some probability of false positives. In an attempt to solve many of the limitations of current inter-networking architectures, some recent ...
Macapuna, Carlos A., Magalhaes, Mauricio F., Rothenberg, Christian Esteve, Verdi, Fabio L., Wiesmaier, Alexander   +4 more
core  

Bloom filters for molecules. [PDF]

J Cheminform, 2023
Medina J, White AD.
europepmc   +1 more source

High-Throughput and Memory-Efficient Pipeline Key-Value Store Architecture on FPGA. [PDF]

Micromachines (Basel)
Wang X, Liu L, Li Y.
europepmc   +1 more source

Enhancing confidentiality and access control in electronic health record systems using a hybrid hashing blockchain framework. [PDF]

Sci Rep
Chakravarthy DG, Gopi R, Murugan S, Joseph ER.   +3 more
europepmc   +1 more source

2D-Cosine power sine coupled map with fractal-Fibonacci fusion for hyperchaotic image encryption. [PDF]

Sci Rep
Kumar M, Ch D.
europepmc   +1 more source