Results 31 to 40 of about 204,288 (176)
Manipulating Voice Attributes by Adversarial Learning of Structured Disentangled Representations
Voice conversion (VC) consists of digitally altering the voice of an individual to manipulate part of its content, primarily its identity, while maintaining the rest unchanged.
Laurent Benaroya +2 more
doaj +1 more source
Kullback–Leibler Divergence Measure for Multivariate Skew-Normal Distributions
The aim of this work is to provide the tools to compute the well-known Kullback–Leibler divergence measure for the flexible family of multivariate skew-normal distributions.
Reinaldo B. Arellano-Valle +1 more
doaj +1 more source
The study of leukemia classification using deep learning techniques has been conducted by multiple research teams worldwide. Although deep convolutional neural networks achieved high quality of sick vs. healthy patient discrimination, their inherent lack
Krzysztof Pałczyński +2 more
doaj +1 more source
Principle of Minimum Discrimination Information and Replica Dynamics
Dynamics of many complex systems can be described by replicator equations (RE). Here we present an effective method for solving a wide class of RE based on reduction theorems for models of inhomogeneous communities.
Georgiy P. Karev
doaj +1 more source
Dimensionality reduction techniques are often used by researchers in order to make high dimensional data easier to interpret visually, as data visualization is only possible in low dimensional spaces. Recent research in nonlinear dimensionality reduction
Liliya A. Demidova, Artyom V. Gorchakov
doaj +1 more source
Sum-α Stopping Criterion for Turbo Decoding [PDF]
In this article, we propose a new stopping criterion for turbo codes. This criterion is based on the behaviour of the probabilistic values alpha 'α' calculated in the forward recursion during turbo decoding. We called this criterion Sum-α. The simulation
Aissa Ouardi
doaj +1 more source
Spoofing Cross-Entropy Measure in Boson Sampling
7+11 pages, 5+6 ...
Changhun Oh, Liang Jiang, Bill Fefferman
openaire +3 more sources
HEAVY TAILS, IMPORTANCE SAMPLING AND CROSS–ENTROPY [PDF]
ABSTRACT We consider the problem of estimating ℙ(Y 1 + … + Y n > x) by importance sampling when the Y i are i.i.d. and heavy-tailed. The idea is to exploit the cross-entropy method as a tool for choosing good parameters in the importance sampling distribution; in doing sso, we use the asymptotic description that given ℙ(Y 1 + … + Y n > x), n − 1 of ...
Asmussen, S. +2 more
openaire +4 more sources
Max-Pooling Loss Training of Long Short-Term Memory Networks for Small-Footprint Keyword Spotting
We propose a max-pooling based loss function for training Long Short-Term Memory (LSTM) networks for small-footprint keyword spotting (KWS), with low CPU, memory, and latency requirements.
Fu, Gengshen +8 more
core +1 more source
The cross-entropy method for continuous multi-extremal optimization [PDF]
In recent years, the cross-entropy method has been successfully applied to a wide range of discrete optimization tasks. In this paper we consider the cross-entropy method in the context of continuous optimization.
A. Webb +23 more
core +1 more source

