Results 241 to 250 of about 24,140,341 (301)
Some of the next articles are maybe not open access.
Constant time generation of derangements
Information Processing Letters, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
James F. Korsh, Paul LaFollette
openaire +2 more sources
Constant time texture filtering
The Visual Computer, 2016We present a novel texture-filtering method which can effectively separate the main image structures from textures even with high variations. Our nonlinear image decomposition is based on a variant of the weighted-median filter which incorporates structure and texture information into the guidance image.
Hanli Zhao +4 more
openaire +1 more source
FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
IEEE transactions on computers, 2020The discrete Gaussian sampler is one of the fundamental tools in implementing lattice-based cryptosystems. However, a naive discrete Gaussian sampling implementation suffers from side-channel vulnerabilities, and the existing countermeasures usually ...
Raymond K. Zhao +2 more
semanticscholar +1 more source
Flipping Persuasively in Constant Time
SIAM Journal on Computing, 1990A persuasive coin is a sufficiently unbiased source of randomness visible to sufficiently many processors in a distributed system. An algorithm is described for achieving a persuasive coin in the presence of an extremely powerful adversary where the number of rounds of message exchange among the processors is constant, independent of the number n of ...
Cynthia Dwork +2 more
openaire +1 more source
Constant-Time BCH Error-Correcting Code
International Symposium on Circuits and Systems, 2020Error-correcting codes can be useful in reducing decryption failure rate of several lattice-based and code-based public-key encryption schemes. Two schemes, namely LAC and HQC, in NIST's round 2 phase of its post-quantum cryptography standardisation ...
M. Walters, S. Roy
semanticscholar +1 more source
2009 13th International Machine Vision and Image Processing Conference, 2009
Typically, local methods for stereo matching are fast but have relatively low degree of accuracy while global ones, though costly, achieve a higher degree of accuracy in retrieving disparity information. Recently, however, some local methods such as those based on segmentation or adaptive weights are suggested to possibly achieve more accuracy than ...
Myung-Ho Ju, Hang-Bong Kang
openaire +1 more source
Typically, local methods for stereo matching are fast but have relatively low degree of accuracy while global ones, though costly, achieve a higher degree of accuracy in retrieving disparity information. Recently, however, some local methods such as those based on segmentation or adaptive weights are suggested to possibly achieve more accuracy than ...
Myung-Ho Ju, Hang-Bong Kang
openaire +1 more source
Predecessor Queries in Constant Time?
2005In this paper we design a new static data structure for batched predecessor queries. In particular, our data structure supports $O(\sqrt{{\rm log}n})$ queries in O(1) time per query and requires $O(n^{\epsilon\sqrt{{\rm log}n}})$ space for any e > 0.
Marek Karpinski, Yakov Nekrich
openaire +1 more source