Amanote Research
Register
Sign In
Finding Maximum Margin Segments in Speech
doi 10.1109/icassp.2007.367225
Full Text
Open PDF
Abstract
Available in
full text
Date
January 1, 2007
Authors
Yago Pereiro Estevan
Vincent Wan
Odette Scharenborg
Publisher
IEEE
Related search
Disjoint Segments With Maximum Density
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Maximum Margin Algorithms With Boolean Kernels
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Finding Maximum Degrees in Hidden Bipartite Graphs
Pathological Voice Detection Using Turbulent Speech Segments
Algorithms for Finding the Weight-Constrained K Longest Paths in a Tree and the Length-Constrained K Maximum-Sum Segments of a Sequence
Theoretical Computer Science
Computer Science
Theoretical Computer Science
Approximation Algorithms for Finding Maximum Induced Expanders
On Finding That Speech Is Special
Efficient and Robust Feature Extraction by Maximum Margin Criterion
IEEE Transactions on Neural Networks
The Algorithm of Finding of K Maximum Flows
SPIIRAS Proceedings
Control
Systems Engineering
Information Systems
Computer Networks
Applied Mathematics
Mathematics
Communications
Computer Science Applications
Computational Theory
Computational Mathematics
Artificial Intelligence
