Results 221 to 230 of about 5,925 (246)

Generating binary trees at random

Information Processing Letters, 1992
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. D. Atkinson, Jörg-Rüdiger Sack
openaire   +2 more sources

Generating binary trees by transpositions

Journal of Algorithms, 1988
Let T(n) denote the set of all bitstrings with n 1's and n 0's such that in every prefix the number of 0's does not exceed the number of 1's. This is a well known representation of binary trees. We consider algorithms that generate the elements of T(n) in such way that successive bitstrings differ by the transposition of two bits.
Frank Ruskey, Andrzej Proskurowski
openaire   +1 more source

The generation of binary and near-binary pseudo-random signals: an overview

IMTC 2001. Proceedings of the 18th IEEE Instrumentation and Measurement Technology Conference. Rediscovering Measurement in the Age of Informatics (Cat. No.01CH 37188), 2002
Pseudorandom signals have been widely used for system identification. Maximum length binary (MLB) signals are the best known class of pseudorandom signals, because of their ease of generation using feedback shift registers, but it is less well known that there are several other classes of binary and near-binary signals with identical, or nearly ...
Ai Hui Tan, Keith R. Godfrey
openaire   +1 more source

Binary Discriminant Analysis for Generating Binary Face Template

IEEE Transactions on Information Forensics and Security, 2012
Although biometrics is more reliable, robust and convenient than traditional methods, security and privacy concerns are growing. Biometric templates stored in databases are vulnerable to attacks if they are not protected. To solve this problem, a biometric cryptosystem approach that combines cryptography and biometrics has been proposed.
Yi Cheng Feng, Pong Chi Yuen
openaire   +1 more source

Generalized Binary Udaya–Siddiqi Sequences

IEEE Transactions on Information Theory, 2004
In this correspondence, we present a family of binary 2n sequences of period 2(2n-1) where n is an integer, which can be seen as a generalization of nonlinear binary sequences obtained from Z4 sequences and recently constructed GKW (Gold, Kasami, and Welch)-like sequences.
Xiaohu Tang 0004, Parampalli Udaya, Pingzhi Fan   +2 more
openaire   +1 more source

A generalization of the binary GCD algorithm

Proceedings of the 1993 international symposium on Symbolic and algebraic computation - ISSAC '93, 1993
A generalization of the binary algorithm for operation at ‘word level” by using a new concept of ‘modular conjugates” computes the GCD of multiprecision integers two times faster than Lehmer–Euclid method. Most importantly, however, the new algorithm is suitable for systolic parallelization, in ‘least-significant digits jirst” pipelined manner and for ...
openaire   +1 more source

The Coolest Way to Generate Binary Strings

Theory of Computing Systems, 2013
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Brett Stevens, Aaron Williams 0001
openaire   +2 more sources

Binary computer-generated holograms

Applied Optics, 1979
Binary computer-generated holograms are similar to interferograms with fringe patterns hardclipped by a photographic process. Therefore the fringe locations in the binary hologram can be determined by solving a grating equation. However, there are two difficulties in using this approach to make binary Fourier transform holograms.
openaire   +2 more sources

A generalization of binary search

1993
Let f be a nondecreasing integer-valued function whose domain is the set of integers [0., n]. The (n, m) problem is the problem of determining f at all points of its domain, given that f(0)=0 and f(n)=m. The paper [HM] determines the worst-case number of function evaluations needed to solve the (n, m) problem and gives one particular algorithm ...
openaire   +1 more source

Uniform Generation of Binary Trees in Parallel

Journal of Parallel and Distributed Computing, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
M. D. Atkinson, Jörg-Rüdiger Sack
openaire   +2 more sources