Results 11 to 20 of about 15,386 (267)
2006 IEEE International Symposium on Information Theory, 2006 Let C = {x_1,...,x_N} ⊂ {0, 1}^n be an [n, N] binary error correcting code (not necessarily linear). Let e ∈ {0, 1}^n be an error vector. A codeword X ∈ C is said to be disturbed by the error e if the closest codeword to X ⴲ e is no longer x.
Michael Langberg, Langberg, Michael
core +4 more sources
On proximity oblivious testing [PDF]
SIAM Journal on Computing, 2009 We initiate a systematic study of a special type of property testers. These testers consist of repeating a basic test for a number of times that depends on the proximity parameter, whereas the basic test is oblivious of the proximity parameter.
Dana Ron, Oded Goldreich
core +3 more sources
Bucket Oblivious Sort: An Extremely Simple Oblivious Sort [PDF]
, 2020 We propose a conceptually simple oblivious sort and oblivious random permutation algorithms called bucket oblivious sort and bucket oblivious random permutation.
Asharov, G +5 more
core +3 more sources
Cache-Oblivious and Data-Oblivious Sorting and Applications [PDF]
, 2018 Although external-memory sorting has been a classical algorithms abstraction and has been heavily studied in the literature, perhaps somewhat surprisingly, when data-obliviousness is a requirement, even very rudimentary questions remain open.
Lin, WK +7 more
core +3 more sources
Cache-Oblivious Persistence [PDF]
, 2014 Partial persistence is a general transformation that takes a data structure and allows queries to be executed on any past state of the structure. The cache-oblivious model is the leading model of a modern multi-level memory hierarchy.
Davoodi, Pooya +7 more
core +5 more sources
Verbigeration of oblivious agony
Annals of Indian Academy of Neurology, 2023 Ajith Cherian
doaj +3 more sources
Oblivious Transfer Is in MiniQCrypt [PDF]
, 2021 MiniQCrypt is a world where quantum-secure one-way functions exist, and quantum communication is possible. We construct an oblivious transfer (OT) protocol in MiniQCrypt that achieves simulation-security in the plain model against malicious quantum polynomial-time adversaries, building on the foundational work of Bennett, Brassard, Crépeau and ...
Alex B. Grilo +3 more
openaire +4 more sources
Cache efficient simple dynamic programming [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 New cache-oblivious and cache-aware algorithms for simple dynamic programming based on Valiant's context-free language recognition algorithm are designed, implemented, analyzed, and empirically evaluated with timing studies and cache simulations.
Cary Cherng, Richard E. Ladner
doaj +1 more source
An Oblivious Approach to Machine Translation Quality Estimation
Mathematics, 2021 Machine translation (MT) is being used by millions of people daily, and therefore evaluating the quality of such systems is an important task. While human expert evaluation of MT output remains the most accurate method, it is not scalable by any means ...
Itamar Elmakias, Dan Vilenchik
doaj +1 more source