Results 1 to 10 of about 3,368 (100)
Binary Domain Generalization for Sparsifying Binary Neural Networks
, 2023 Accepted as conference paper at ECML PKDD ...
Riccardo Schiavone +2 more
openaire +3 more sources
On generating binary words palindromically
Journal of Combinatorial Theory, Series A, 2015 We regard a finite word $u=u_1u_2\cdots u_n$ up to word isomorphism as an equivalence relation on $\{1,2,\ldots, n\}$ where $i$ is equivalent to $j$ if and only if $x_i=x_j.$ Some finite words (in particular all binary words) are generated by "{\it palindromic}" relations of the form $k\sim j+i-k$ for some choice of $1\leq i\leq j\leq n$ and $k\in \{i ...
Tero Harju, Mari Huova, Luca Q. Zamboni
openaire +2 more sources
A generalization of the binary Preparata code
Discrete Applied Mathematics, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Alexey S. Kuzmin +3 more
openaire +2 more sources
Generating binary sequences for stochastic computing [PDF]
IEEE Transactions on Information Theory, 1994 Summary: This paper describes techniques for constructing statistically independent binary sequences with prescribed ratios of zeros and ones. The first construction is a general recursive construction, which forms the sequences from a class of ``elementary'' sequences.
Peter Jeavons 0001 +2 more
openaire +1 more source
Binary cyclotomic generators [PDF]
, 1995 In this paper a number of binary cyclotomic generators based on cyclotomy are described. A number of cryptographic properties of the generators are controlled. A general approach to control the linear complexity and its stability for periodic sequences over any field is shown.
openaire +2 more sources
Journal of Combinatorial Theory, Series A, 2003 This very interesting and well written paper solves completely the following problem: let \(r \geq \rho \geq 3\) integers and denote \textbf{F}\(^r_2\) the elementary 2-group of rank \(r\). Then the maximum possible size of a generating subset \(A\) of \textbf{F}\(^r_2,\) such that not all element of \textbf{F}\(^r_2\) are representable as a sum of ...
openaire +1 more source
The Geometry of Generalized Binary Search [PDF]
IEEE Transactions on Information Theory, 2011 corrected typo in Thm ...
openaire +4 more sources
Brill-Noether generality of binary curves [PDF]
Canadian Mathematical Bulletin, 2020 AbstractWe show that the space $G^r_{\underline d}(X)$ of linear series of certain multi-degree $\underline d=(d_1,d_2)$ (including the balanced ones) and rank r on a general genus-g binary curve X has dimension $\rho _{g,r,d}=g-(r+1)(g-d+r)$ if nonempty, where $d=d_1+d_2$ .
openaire +2 more sources
On multidimensional generalization of binary search
CoRRThis work generalizes the binary search problem to a $d$-dimensional domain $S_1\times\cdots\times S_d$, where $S_i=\{0, 1, \ldots,n_i-1\}$ and $d\geq 1$, in the following way. Given $(t_1,\ldots,t_d)$, the target element to be found, the result of a comparison of a selected element $(x_1,\ldots,x_d)$ is the sequence of inequalities each stating that ...
Dariusz Dereniowski +2 more
openaire +3 more sources
Run distribution innonlinear binary generators
Applied Mathematics Letters, 2004 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +1 more source