| 1 |
Prosodic Boundary Prediction Model for Vietnamese Text-To-Speech
|
|
|
|
In: Proc. Interspeech 2021 ; Interspeech 2021 ; https://hal.archives-ouvertes.fr/hal-03329116 ; Interspeech 2021, Aug 2021, Brno, Czech Republic. pp.3885-3889, ⟨10.21437/interspeech.2021-125⟩ (2021)
|
|
BASE
|
|
Show details
|
|
|
| 2 |
Using ICT to foster collaborative writing for EFL university students in Vietnam
|
|
Nguyen, Thi Thu Lan. - : Edith Cowan University, Research Online, Perth, Western Australia, 2019
|
|
In: Theses: Doctorates and Masters (2019)
|
|
BASE
|
|
Show details
|
|
|
| 3 |
Consciousness-raising in translation teaching in a tertiary English language program in Vietnam
|
|
|
|
BASE
|
|
Show details
|
|
|
| 4 |
The teaching of communication strategies to non-English major students in Vietnam
|
|
|
|
BASE
|
|
Show details
|
|
|
| 5 |
Towards a Realistic Analysis of Some Popular Sorting Algorithms
|
|
|
|
In: ISSN: 0963-5483 ; EISSN: 1469-2163 ; Combinatorics, Probability and Computing ; https://hal.archives-ouvertes.fr/hal-01103998 ; Combinatorics, Probability and Computing, Cambridge University Press (CUP), 2015, (Honouring the Memory of Philippe Flajolet - Part 3, 24 (01), pp.104-144. ⟨10.1017/S0963548314000649⟩ ; http://journals.cambridge.org (2015)
|
|
BASE
|
|
Show details
|
|
|
| 6 |
Intonation issues in HMM-based speech synthesis for Vietnamese
|
|
|
|
In: International Workshop on Spoken Languages Technologies for Under-resourced languages (SLTU 2014) ; https://hal.archives-ouvertes.fr/hal-01621850 ; International Workshop on Spoken Languages Technologies for Under-resourced languages (SLTU 2014), 2014, St Petersburg, Russia. pp.98-104 (2014)
|
|
BASE
|
|
Show details
|
|
|
| 7 |
Prosodic phrasing modeling for Vietnamese TTS using syntactic information
|
|
|
|
In: Annual Conference of the International Speech Communication Association (INTERSPEECH 2014) ; https://hal.archives-ouvertes.fr/hal-01621851 ; Annual Conference of the International Speech Communication Association (INTERSPEECH 2014), 2014, Singapore, Singapore. pp.2332-2336 (2014)
|
|
BASE
|
|
Show details
|
|
|
| 8 |
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
|
|
|
|
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) ; https://hal.archives-ouvertes.fr/hal-00913309 ; 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013, Kiel, Germany. pp.598--609, ⟨10.4230/LIPIcs.STACS.2013.598⟩ (2013)
|
|
BASE
|
|
Show details
|
|
|
| 9 |
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
|
|
|
|
In: 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013) ; https://hal.archives-ouvertes.fr/hal-01086576 ; 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), Feb 2013, Kiel, Germany (2013)
|
|
Abstract:
International audience ; We describe a general framework for realistic analysis of sorting and searchingalgorithms, and we apply it to the average-case analysis of five basic algorithms: threesorting algorithms (QuickSort, InsertionSort, BubbleSort) and two selection algorithms(QuickMin and SelectionMin). Usually, the analysis deals with the mean number of keycomparisons, but, here, we view keys as words produced by the same source, which arecompared via their symbols in the lexicographic order. The “realistic” cost of the algorithmis now the total number of symbol comparisons performed by the algorithm, and, in thiscontext, the average–case analysis aims to provide estimates for the mean number ofsymbol comparisons used by the algorithm. For sorting algorithms, and with respectto key comparisons, the average-case complexity of QuickSort is asymptotic to 2n log n,InsertionSort to n2/4 and BubbleSort to n2/2. With respect to symbol comparisons,we prove that their average-case complexity becomes (n log2 n),(n2),(n2 log n). Forselection algorithms, and with respect to key comparisons, the average-case complexityof QuickMin is asymptotic to 2n, of SelectionMin is n − 1. With respect to symbolcomparisons, we prove that their average-case complexity remains (n). In these fivecases, we describe the dominant constants which exhibit the probabilistic behaviour of thesource (namely, entropy, and various notions of coincidence) with respect to the algorithm.
|
|
Keyword:
[INFO.INFO-DS]Computer Science [cs]/Data Structures and Algorithms [cs.DS]; [INFO]Computer Science [cs]
|
|
URL: https://hal.archives-ouvertes.fr/hal-01086576/file/ACTI-CLEMENT-2013-2.pdf
https://hal.archives-ouvertes.fr/hal-01086576
https://hal.archives-ouvertes.fr/hal-01086576/document
|
|
BASE
|
|
Hide details
|
|
|
| 10 |
HMM-based TTS for Hanoi Vietnamese: issues in design and evaluation
|
|
|
|
In: Annual Conference of the International Speech Communication Association (INTERSPEECH 2013) ; https://hal.archives-ouvertes.fr/hal-01621853 ; Annual Conference of the International Speech Communication Association (INTERSPEECH 2013), 2013, Lyon, France. pp.2311-2315 (2013)
|
|
BASE
|
|
Show details
|
|
|
| 11 |
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms
|
|
Nguyen Thi, Thu Hien. - : Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. : LIPIcs - Leibniz International Proceedings in Informatics. 30th International Symposium on Theoretical Aspects of Computer Science (STACS 2013), 2013
|
|
BASE
|
|
Show details
|
|
|
| 12 |
A general framework for the realistic analysis of sorting and searching algorithms. Application to some popular algorithms ...
|
|
|
|
BASE
|
|
Show details
|
|
|
|
|
