Hi,everybody .I am working on speech segmentation and i have a little problem.For example i have an array ex. a[n],n quite large(size above 20k) and i want to make a segmentation..For instance say a good segmentation is an output like a[1]..a[k1],a[k1+1]..a[k3],....,a[k(n-1)+1]..a[k],where the distance a[1]...a[k1] represents a phoneme such as /a/,/e/,etc.(for this an signal processing-feature extraction module has been implemented) Is there any who has an idea for an online algorithm,or a good one(say polynomial),with any algorithmic strategy in mind such as dynamic programming,greedy,randomized... Thanks. Cheers.. Yannis
--~--~---------~--~----~------------~-------~--~----~ You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com To unsubscribe from this group, send email to [EMAIL PROTECTED] For more options, visit this group at http://groups.google.com/group/algogeeks -~----------~----~----~----~------~----~------~--~---
