![]() |
Volumn 6, Issue , 2000, Pages 3751-3754
|
Reducing computational complexity and response latency through the detection of contentless frames
|
Author keywords
[No Author keywords available]
|
Indexed keywords
COMPLEX NETWORKS;
COMPUTATIONAL COMPLEXITY;
DYNAMIC PROGRAMMING;
ACOUSTIC SIGNAL PROCESSING;
MARKOV PROCESSES;
MATHEMATICAL MODELS;
RESPONSE TIME (COMPUTER SYSTEMS);
VECTOR QUANTIZATION;
BASELINE SYSTEMS;
CONNECTED DIGITS;
EARLY DECISION;
LARGE VOCABULARY;
RECOGNITION ACCURACY;
TREE-STRUCTURED;
SIGNAL PROCESSING;
SPEECH RECOGNITION;
EARLY DECISION METHOD;
HIDDEN MARKOV MODEL;
RESPONSE LATENCY;
SILENCE BASED PRUNING;
SILENCE SKIPPING;
TREE STRUCTURED VECTOR QUANTIZATION CLASSIFIER;
|
EID: 0033694004
PISSN: 15206149
EISSN: None
Source Type: Conference Proceeding
DOI: 10.1109/ICASSP.2000.860218 Document Type: Conference Paper |
Times cited : (3)
|
References (7)
|