A2TTS adds a reference-audio cross-attention duration predictor to a Grad-TTS and UnitSpeech style diffusion TTS, improving speaker similarity scores in seven Indian languages.
Settling the nonorientable genus of the nearly complete bipartite graphs
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
A graph is said to be nearly complete bipartite if it can be obtained by deleting a set of independent edges from a complete bipartite graph. The nonorientable genus of such graphs is known except in a few cases where the sizes of the partite classes differ by at most one, and a maximum matching is deleted. We resolve these missing cases using three classic tools for constructing genus embeddings of the complete bipartite graphs: current graphs, diamond sums, and the direct rotation systems of Ringel.
fields
cs.SD 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
A2TTS: TTS for Low Resource Indian Languages
A2TTS adds a reference-audio cross-attention duration predictor to a Grad-TTS and UnitSpeech style diffusion TTS, improving speaker similarity scores in seven Indian languages.