TOWARDS A MORE EFFICIENT SVM SUPERVECTOR SPEAKER VERIFICATION SYSTEM USING GAUSSIAN REDUCTION AND A TREE-STRUCTURED HASH.
Conference
·
OSTI ID:1106049
Abstract not provided.
- Research Organization:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Organization:
- USDOE National Nuclear Security Administration (NNSA)
- DOE Contract Number:
- AC04-94AL85000
- OSTI ID:
- 1106049
- Report Number(s):
- SAND2013-6633C; 464805
- Resource Relation:
- Conference: Proposed for presentation at the Interspeech 2013 held August 25-29, 2013 in Lyon, France.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Towards a More Efficient SVM Supervector Speaker Verification System using Gaussian Reduction and a Tree-Structured Hash.
Efficient Speaker Verification using Gaussian Reuction and a Tree-Structured Hash.
Reducing Computation in an i-Vector Speaker Recognition System using a Tree-Structured Universal Background Model.
Conference
·
Fri Mar 01 00:00:00 EST 2013
·
OSTI ID:1106049
Efficient Speaker Verification using Gaussian Reuction and a Tree-Structured Hash.
Conference
·
Thu Nov 01 00:00:00 EDT 2012
·
OSTI ID:1106049
Reducing Computation in an i-Vector Speaker Recognition System using a Tree-Structured Universal Background Model.
Journal Article
·
Thu Aug 01 00:00:00 EDT 2013
· IEEE Transactions on Audio, Speech, and Language Processing
·
OSTI ID:1106049