Dror Chawin
YOU?
Author Swipe
Improved Approximation Algorithms for Index Coding Open
The index coding problem is concerned with broadcasting encoded information to a collection of receivers in a way that enables each receiver to discover its required data based on its side information, which comprises the data required by …
Nearly Orthogonal Sets over Finite Fields Open
For a field $\mathbb{F}$ and integers $d$ and $k$, a set of vectors of $\mathbb{F}^d$ is called $k$-nearly orthogonal if its members are non-self-orthogonal and every $k+1$ of them include an orthogonal pair. We prove that for every prime …
Improved NP-Hardness of Approximation for Orthogonality Dimension and Minrank Open
The orthogonality dimension of a graph $G$ over $\mathbb{R}$ is the smallest integer $k$ for which one can assign a nonzero $k$-dimensional real vector to each vertex of $G$, such that every two adjacent vertices receive orthogonal vectors…
On the Subspace Choosability in Graphs Open
A graph $G$ is said to be $k$-subspace choosable over a field $F$ if for every assignment of $k$-dimensional subspaces of some finite-dimensional vector space over $F$ to the vertices of $G$, it is possible to choose for each vertex a nonz…
The Mozart Expositional Punctuation Corpus: A Dataset of Interthematic Cadences in Mozart's Sonata-Allegro Exposition Open
This report documents a dataset consisting of expert annotations (symbolic data) of interthematic (higher-level) cadences in the exposition sections of all of Mozart's instrumental sonata-allegro movements.
On the Vector Choosability in Graphs Open
A graph $G$ is said to be $k$-vector choosable over a field $\mathbb{F}$ if for every assignment of $k$-dimensional subspaces of some finite-dimensional vector space over $\mathbb{F}$ to the vertices of $G$, it is possible to choose for ea…
On the Subspace Choosability in Graphs Open
A graph $G$ is said to be $k$-subspace choosable over a field $\mathbb{F}$ if for every assignment of $k$-dimensional subspaces of some finite-dimensional vector space over $\mathbb{F}$ to the vertices of $G$, it is possible to choose for …
Sliding-Window Pitch-Class Histograms as a Means of Modeling Musical Form Open
This study proposes a fine-tuned approach to modeling musical form in Classical repertoires by analyzing pitch-class distributions in symbolic data using machine learning algorithms. Results suggest that sliding-window histograms, which ta…