19.0 Conclusion
Reference: 1. Special Issue on Speech Technology in Human-Machine
Communication, IEEE Signal Processing Magazine, Sept 2005
2. Special Issue on Spoken Language Technology, IEEE Signal
Processing Magazine, May 2008
Concluding Remarks
Inter
Balanced Binary Search Trees
Data Structures and Programming
g
g
Height is O(log n) where n is the number of
n),
elements in the tree
AVL (Adelson-Velsky and Landis) trees
Red-Black
Red Black trees
find, insert, and erase take O(log n) time
Topic 12 Balan
Nature Lover s View of A Tree
Lovers
Data Structures and Programming
leaves
Topic 8 Binary and Other Trees
901 31900 EE 3011
678 229
branches
root
2
Computer Scientist s View
Scientists
Linear Lists and Trees
Linear lists are useful for serially ordere
Tournament Trees
Data Structures and Programming
g
g
Winner Trees.
Trees
Loser Trees.
Topic 10 Tournament Trees
901 31900 EE 3011
678 229
2
Winner Trees
Abstract Data Type WinnerTree
Complete binary tree with n external nodes and
n 1 internal nodes.
Priority Queues
Data Structures and Programming
g
g
Two kinds of priority queues:
Max priority queue.
Min priority queue.
Topic 9 Priority Queues
901 31900 EE 3011
678 229
2
Abstract Data Type of maxPriorityQueue
Max Priority Queue
AbstractDataType maxP
Binary Search Trees
Data Structures and Programming
g
g
Dictionary Operations:
find(key)
i
insert(key, value)
t(k
l )
erase(key)
Topic 11 Binary Search Trees
Additional operations:
ascend()
get(index) (indexed binary search tree)
delete(index) (in
Abstract Data Type array
Data Structures and Programming
Abstract Data Type (ADT)
AbstractDataType array
cfw_
instances
Topic 5 Arrays and Matrices
set of (index, value) pairs, no two pairs have the same index
operations
get(index): return the value of t
Dictionaries
Data Structures and Programming
Collection of pairs.
Topic 7 Dictionary, Hashing and
Data Compression
Operations.
(key,element)
Pairs have different keys.
find(theKey)
erase(theKey)
insert(theKey,theElement)
901 31900 EE 3011
678 229
2
C+ Review
Data Structures and Programming
Topic 1 Programming Techniques
901 31900 EE 3011
678 229
Function and Parameters
Exceptions
Dynamic Memory Allocation
Your Very Own Data Type
Exception Class
Recursion
Standard Templates Library
Testing and Debugg
Limitations of C+ Pointers
Data Structures and Programming
May be used for internal data structures only.
Data structure backup requires serialization
and deserialization.
No arithmetic.
Topic 4B Simulated Pointers and
Memory Management
901 31900 EE 30
18.0 Some Recent Developments in NTU
Reference: 1. Segmental Eigenvoice with Delicate Eigenspace for Improved Speaker Adaptation,
IEEE Transactions on Speech and Audio Processing, Vol.13, No.3, May 2005,
pp.399-411.
2. Higher Order Cepstral Moment Nomaliz
Graphs
Data Structures and Programming
g
g
Topic 13 Graphs
901 31900 EE 3011
678 229
G = (V E)
(V,
V is the vertex set.
Vertices are also called nodes and points.
E i the edge set.
is th d
t
Each edge co ects two different vertices.
ac
connects
d e e t