Results 271 to 280 of about 1,252,930 (316)
Some of the next articles are maybe not open access.
A binary wavelet decomposition of binary images
IEEE Transactions on Image Processing, 1996We construct a theory of binary wavelet decompositions of finite binary images. The new binary wavelet transform uses simple module-2 operations. It shares many of the important characteristics of the real wavelet transform. In particular, it yields an output similar to the thresholded output of a real wavelet transform operating on the underlying ...
Mitchell D. Swanson, Ahmed H. Tewfik
openaire +2 more sources
SIAM Journal on Discrete Mathematics, 2012
A subset $V \subseteq \mathbb{F}_2^n$ is a tile if $\mathbb{F}_2^n$ can be covered by disjoint translates of $V$. In other words, $V$ is a tile if and only if there is a subset $A \subseteq \mathbb{F}_2^n$ such that $V+A = \mathbb{F}_2^n$ uniquely (i.e., $v + a = v' + a'$ implies that $v=v'$ and $a=a'$, where $v,v' \in V$ and $a,a' \in A$).
Don Coppersmith, Victor S. Miller
openaire +1 more source
A subset $V \subseteq \mathbb{F}_2^n$ is a tile if $\mathbb{F}_2^n$ can be covered by disjoint translates of $V$. In other words, $V$ is a tile if and only if there is a subset $A \subseteq \mathbb{F}_2^n$ such that $V+A = \mathbb{F}_2^n$ uniquely (i.e., $v + a = v' + a'$ implies that $v=v'$ and $a=a'$, where $v,v' \in V$ and $a,a' \in A$).
Don Coppersmith, Victor S. Miller
openaire +1 more source
Binary Patterns in Infinite Binary Words
2002In this paper we study the set P(w) of binary patterns that can occur in one infinite binary word w, comparing it with the set F(w) of factors of the word. Since the set P(w) can be considered as an extension of the set F(w), we first investigate how large is such extension, by introducing the parameter ?(w) that corresponds to the cardinality of the ...
Antonio Restivo, Sergio Salemi
openaire +1 more source
Binary Vectors and Super-binary Vectors
2006A binary vector is a standard tool in the transformation of higher plants mediated by Agrobacterium tumefaciens. It is composed of the borders of T-DNA, multiple cloning sites, replication functions for Escherichia coli and A. tumefaciens, selectable marker genes, reporter genes, and other accessory elements that can improve the efficiency of and/or ...
Toshihiko, Komari +5 more
openaire +2 more sources
Simulation of binary-single star and binary-binary scattering
Journal of Computational Physics, 1986Numerical methods for integrating gravitational 3- and 4-body systems are investigated and tested. The methods employ multiple-pair regularization schemes for N-body systems which use the Kustaanheimo-Stiefel transformation for regularizing 2-body collisions, in conjunction with a number of different time transformations between ''physical'' and ...
openaire +1 more source
Serial Binary-to-Decimal and Decimal-to-Binary Conversion
IEEE Transactions on Computers, 1970Over ten years ago, Couleur described a serial binary/ decimal conversion algorithm, the BIDEC method. This was a two-step process involving a shift followed by a parallel modification of the data being converted. With the integrated-circuit J-K flip-flop, the implementation of this two-step process requires an excessive amount of control logic.
openaire +2 more sources
Science, 1984
Most stars in the solar neighborhood are either double or multiple systems. They provide a unique opportunity to measure stellar masses and radii and to study many interesting and important phenomena. The best candidates for black holes are compact massive components of two x-ray binaries: Cygnus X-1 and LMC X-3.
openaire +2 more sources
Most stars in the solar neighborhood are either double or multiple systems. They provide a unique opportunity to measure stellar masses and radii and to study many interesting and important phenomena. The best candidates for black holes are compact massive components of two x-ray binaries: Cygnus X-1 and LMC X-3.
openaire +2 more sources
ACM Transactions on Design Automation of Electronic Systems, 2007
Recent high-level synthesis approaches and C-based hardware description languages attempt to improve the hardware design process by allowing developers to capture desired hardware functionality in a well-known high-level source language. However, these approaches have yet to achieve wide commercial success due in part to the difficulty of incorporating
Greg Stitt, Frank Vahid
openaire +1 more source
Recent high-level synthesis approaches and C-based hardware description languages attempt to improve the hardware design process by allowing developers to capture desired hardware functionality in a well-known high-level source language. However, these approaches have yet to achieve wide commercial success due in part to the difficulty of incorporating
Greg Stitt, Frank Vahid
openaire +1 more source
On the conversion between binary code and binary-reflected Gray code on binary cubes
IEEE Transactions on Computers, 1995Summary: We present a new algorithm for conversion between binary code and binary-reflected Gray code that requires approximately \({2K\over 3}\) element transfers in sequence for \(K\) elements per node, compared to \(K\) element transfers for previously known algorithms.
S. Lennart Johnsson, Ching-Tien Ho
openaire +2 more sources
Communications of the ACM, 1971
In discussing his binary summation method [1] Linz mentions two defects: “It is more difficult to program than the standard method, and it is difficult to use unless all numbers are available at the start of the summation.” A defect not mentioned is the extra storage space (approximately N words) required for the
openaire +2 more sources
In discussing his binary summation method [1] Linz mentions two defects: “It is more difficult to program than the standard method, and it is difficult to use unless all numbers are available at the start of the summation.” A defect not mentioned is the extra storage space (approximately N words) required for the
openaire +2 more sources