Results 211 to 220 of about 5,925 (246)

A binary merger product as the direct progenitor of a Type II-P supernova

Niu* Z, Sun* N, Zapartas* E, Souropanis D, Cui Y, Maund JR, Andrews JJ, Briel MM, Fraser M, Gossage S, Kruckow MU, Liotine C, Liu Z, Srivas PM, Teng E, Wang X, Yang Y, Liu J.   +17 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

On the Generalized Binary System

IEEE Transactions on Computers, 1982
In this correspondence we derive algorithms for multioperand addition of Koren's generalized number system. A carry-lookahead adder for fast addition of two operands in generalized binary numbers is developed. Truncation errors for this type of representation are examined and rounding algorithms are presented to reduce these errors.
Laxmi N. Bhuyan, Dharma P. Agrawal
openaire   +1 more source

Generative binary codes

Formal Pattern Analysis & Applications, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Michael Haft, Reimar Hofmann, Volker Tresp   +2 more
openaire   +1 more source

Generating Binary Trees Lexicographically

SIAM Journal on Computing, 1977
We represent a binary tree by the level numbers of its leaves from left to right. Thus every binary tree of n leaves corresponds to a sequence of n numbers. We first give the necessary and sufficient conditions for a sequence to represent a binary tree; then we give an algorithm for generating all the feasible sequences lexicographically as a list ...
Frank Ruskey, T. C. Hu
openaire   +1 more source

On Rotations and the Generation of Binary Trees

Journal of Algorithms, 1993
Summary: The rotation graph, \(G_ n\), has vertex set consisting of all binary trees with \(n\) nodes. Two vertices are connected by an edge if a single rotation will transform one tree into the other. We provide a simpler proof of a result of {\t J. M. Lucas} [J. Algorithms 8, 503-535 (1987; Zbl 0641.05015)] that \(G_ n\) contains a Hamilton path. Our
Joan M. Lucas, Dominique Roelants van Baronaigien, Frank Ruskey   +2 more
openaire   +1 more source

Generalized binary split trees

Acta Informatica, 1984
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Shou-Hsuan Stephen Huang, C. K. Wong
openaire   +2 more sources

Generation of noise in binary images

CVGIP: Graphical Models and Image Processing, 1991
Summary: We present an algorithm for binary noise generation, with which noisy images with specific noise levels can be generated for any given binary image. It should facilitate the experimental evaluation of different image processing and classification algorithms on binary images.
Xiaohua Zhou, Richard Gordon 0001
openaire   +1 more source

A random binary tree generator

Proceedings of the seventeenth annual ACM conference on Computer science : Computing trends in the 1990's Computing trends in the 1990's - CSC '89, 1989
Let B(N) denote the set of all binary trees that have N nodes. A procedure for randomly generating the trees in B(N) such that each tree is equally likely to occur, that is an unbiased random generator, is given which runs in O(N) time, requires very little storage, and uses a system of arithmetic no larger than is required to represent the number U ...
Harold W. Martin, B. J. Orr
openaire   +1 more source

Generalized binary search

2008 46th Annual Allerton Conference on Communication, Control, and Computing, 2008
This paper studies a generalization of the classic binary search problem of locating a desired value within a sorted list. The classic problem can be viewed as determining the correct one-dimensional, binary-valued threshold function from a finite class of such functions based on queries taking the form of point samples of the function.
openaire   +1 more source

On some generalizations of binary search

Proceedings of the sixth annual ACM symposium on Theory of computing - STOC '74, 1974
Classic binary search is extended to multidimensional search problems. These new search methods can efficiently solve several important problems of computer science. Applications of these results to an open problem in the theory of computation are discussed yielding new insight into the Lba problem.
David P. Dobkin, Richard J. Lipton
openaire   +1 more source