Results 1 to 10 of about 4,192 (267)
Binary Domain Generalization for Sparsifying Binary Neural Networks
, 2023 Accepted as conference paper at ECML PKDD ...
Riccardo Schiavone +2 more
openaire +3 more sources
Generalized Binary Time Series Models [PDF]
Econometrics, 2019 The serial dependence of categorical data is commonly described using Markovian models. Such models are very flexible, but they can suffer from a huge number of parameters if the state space or the model order becomes large. To address the problem of a large number of model parameters, the class of (new) discrete autoregressive moving-average (NDARMA ...
Jentsch, Carsten, Reichmann, Lena
openaire +3 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.
Jeavons, P., Cohen, D., Shawe-Taylor, J.
openaire +2 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 ...
Harju, Tero +2 more
openaire +2 more sources
Binary search trees for generalized measurements [PDF]
Physical Review A, 2008 Generalized quantum measurements (POVMs or POMs) are important for optimally extracting information for quantum communication and computation. The standard realization via the Neumark extension requires extensive resources in the form of operations in an extended Hilbert space. For an arbitrary measurement, we show how to construct a binary search tree
Andersson, E., Oi, Daniel K.L.
openaire +3 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
Binary Matrix Factorisation via Column Generation
Proceedings of the AAAI Conference on Artificial Intelligence, 2021 Identifying discrete patterns in binary data is an important dimensionality reduction tool in machine learning and data mining. In this paper, we consider the problem of low-rank binary matrix factorisation (BMF) under Boolean arithmetic. Due to the hardness of this problem, most previous attempts rely on heuristic techniques.
Kovacs, RA, Gunluk, O, Hauser, R
openaire +3 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
Binary Computer-Generated Holograms by Simulated-Annealing Binary Search
Photonics, 2022 The binary computer-generated hologram (BCGH) has attracted much attention recently because it can address the high-speed binary spatial light modulator (SLM), such as a digital micromirror device (DMD) SLM. In this paper, our concern is the development of an algorithm to produce high-quality BCGHs.
Jung-Ping Liu, Chen-Ming Tsai
openaire +2 more sources
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 +1 more source