Results 1  10
of
294
Java and the Java Virtual Machine  Definition, Verification, Validation
, 2001
"... State Machines which one may view as code written in an abstract programming language, can be applied to other virtual machines and to other programming languages as well. The target readers are practitionersprogrammers, implementors, standardizers, lecturers, studentswho need for their work ..."
Abstract

Cited by 112 (14 self)
 Add to MetaCart
a complete, correct, and at the same time transparent definition, and an executable model of the language and of the virtual machine underlying its intended implementation. As a consequence, in our models for the language and the machine, we first of all try to directly and faithfully reflect, in a
Maximum a posteriori adaptation of the centroid model for speaker verification
 IEEE Signal Process. Lett
, 2008
"... Abstract—Maximum a posteriori adapted Gaussian mixture model (GMMMAP) is widely used in speaker verification. GMMs have three sets of parameters to be adapted: means, covariances, and weights. However, practice has shown that it is sufficient to adapt the means only. Motivated by this, we formulate ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
Abstract—Maximum a posteriori adapted Gaussian mixture model (GMMMAP) is widely used in speaker verification. GMMs have three sets of parameters to be adapted: means, covariances, and weights. However, practice has shown that it is sufficient to adapt the means only. Motivated by this, we
Verification of functional a posteriori error estimates for obstacle problem in 2D
, 2014
"... We verify functional a posteriori error estimate proposed by S. Repin [17] for a class of obstacle problems. The obstacle problem is formulated as a quadratic minimization problem with constrains equivalently formulated as a variational inequality. New benchmarks with known analytical solutions in 2 ..."
Abstract
 Add to MetaCart
We verify functional a posteriori error estimate proposed by S. Repin [17] for a class of obstacle problems. The obstacle problem is formulated as a quadratic minimization problem with constrains equivalently formulated as a variational inequality. New benchmarks with known analytical solutions
Automatic A Posteriori Verification of Certain Global Sourcecode Restructuring Transformations
, 2002
"... this article. Naturally, many methodical design frameworks, targeted to certain specic application domains, advocate transformations of high level executable specication written in languages like C, SystemC, etc. Our own motivation comes from the Data Transfer and Storage Exploration (DTSE) design f ..."
Abstract
 Add to MetaCart
this article. Naturally, many methodical design frameworks, targeted to certain specic application domains, advocate transformations of high level executable specication written in languages like C, SystemC, etc. Our own motivation comes from the Data Transfer and Storage Exploration (DTSE) design framework [1]
A posteriori estimation of dimension reduction errors
 the Proceedings of ENUMATH 2003 Conference
, 2003
"... A new aposteriori error estimator is presented for the verification of the dimensionally reduced models stemming from the elliptic problems on thin domains. The original problem is considered in a general setting, without any specific assumptions on the domain geometry, coefficients and the righth ..."
Abstract

Cited by 6 (3 self)
 Add to MetaCart
A new aposteriori error estimator is presented for the verification of the dimensionally reduced models stemming from the elliptic problems on thin domains. The original problem is considered in a general setting, without any specific assumptions on the domain geometry, coefficients and the right
Algorithms: A quest for absolute definitions
 Bulletin of the European Association for Theoretical Computer Science
, 2003
"... y Abstract What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the ChurchTurin ..."
Abstract

Cited by 21 (10 self)
 Add to MetaCart
y Abstract What is an algorithm? The interest in this foundational problem is not only theoretical; applications include specification, validation and verification of software and hardware systems. We describe the quest to understand and define the notion of algorithm. We start with the Church
Similarity Normalization Method Based on World Model and a Posteriori Probability for Speaker Verification
 In proceedings of Eurospeech’99
, 1999
"... For the task of speaker verification, similarity measure normalization methods are relevant to cope with variability problems and with data and/or decision fusion issues. The aim of this paper is to suggest a new normalization method, which combines classical world modelbased normalization techniqu ..."
Abstract

Cited by 8 (4 self)
 Add to MetaCart
techniques with a posteriori probabilitybased ones. This method presents the wellknown advantages of the a posteriori probabilitybased methods without requiring data and speaker specific processing. Here, it is experimented through a temporalsegmental, multirecognizer speaker verification system
Comparing maximum a posteriori vector quantization and gaussian mixture models in speaker verification
 in Acoustics, Speech and Signal Processing, 2009. ICASSP 2009
, 2009
"... Comparing maximum a posteriori vector quantization and Gaussian mixture models in speaker verification ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Comparing maximum a posteriori vector quantization and Gaussian mixture models in speaker verification
A comparative study of adaptation methods for speaker verification
 in ICSLP, 2002
"... Reallife speaker verification systems are often implemented using client model adaptation methods, since the amount of data available for each client is often too low to consider plain Maximum Likelihood methods. While the Bayesian Maximum A Posteriori (MAP) adaptation method is commonly used in sp ..."
Abstract

Cited by 41 (13 self)
 Add to MetaCart
Reallife speaker verification systems are often implemented using client model adaptation methods, since the amount of data available for each client is often too low to consider plain Maximum Likelihood methods. While the Bayesian Maximum A Posteriori (MAP) adaptation method is commonly used
Mechanical aposteriori Verification of Results: A Case Study for a Safety Critical AI System
 In: KHATIB, Lina; PECHEUR, Charles: ModelBased Validation of Intelligence  Papers from 2001 AAAI Spring Symposium. AAAI Press, Menlo Park
, 2001
"... This paper is to show how mechanical theorem proving can be used to verify even complex and heuristic programs like mission critical expert systems. Our approach is mechanical in two ways: The basic idea of runtime result verification is to validate each program result (at runtime) rather than t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
to verify the program itself beforehand. Filtering each result by a sufficient algorithmic correctness predicate guarantees partial correctness of the modified program, if successful checking is proved to imply correctness of the result. We use a mechanical theorem prover to prove the latter fact.
Results 1  10
of
294