23,737 research outputs found
Classification of Triadic Chord Inversions Using Kohonen Self-organizing Maps
In this paper we discuss the application of the Kohonen Selforganizing
Maps to the classification of triadic chords in inversions and root
positions. Our motivation started in the validation of Schönberg´s hypotheses of
the harmonic features of each chord inversion. We employed the Kohonen
network, which has been generally known as an optimum pattern classification
tool in several areas, including music, to verify that hypothesis. The outcomes
of our experiment refuse the Schönberg´s assumption in two aspects: structural
and perceptual/functional
Parameterized Complexity of Equitable Coloring
A graph on vertices is equitably -colorable if it is -colorable and
every color is used either or times.
Such a problem appears to be considerably harder than vertex coloring, being
even for cographs and interval graphs.
In this work, we prove that it is for block
graphs and for disjoint union of split graphs when parameterized by the number
of colors; and for -free interval graphs
when parameterized by treewidth, number of colors and maximum degree,
generalizing a result by Fellows et al. (2014) through a much simpler
reduction.
Using a previous result due to Dominique de Werra (1985), we establish a
dichotomy for the complexity of equitable coloring of chordal graphs based on
the size of the largest induced star.
Finally, we show that \textsc{equitable coloring} is when
parameterized by the treewidth of the complement graph
- …