( en | de | ru )

 

Disambiguation of "Wu, Chenchen"

Author of the publication

copydeleteadd this publication to your clipboard
Speaker Identification System Based on Lip-Motion Feature.

, , , and . ICVS, volume 10528 of Lecture Notes in Computer Science, page 289-299. Springer, (2017)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Chenchen Xi

Chenchen Zheng

Jinglan Wu

Recovery of citric acid from fermentation broth using simulated moving bed technology: = Reinigung von Zitronensäure aus Fermentationslösung durch kontinuierliche Chromatographie. Uni Erlangen-Nürnberg, (2009)

Changzhu Wu

Jinjin Wu

 

Other publications of authors with the same name

Primal-dual approximation algorithm for the two-level facility location problem via a dual quasi-greedy approach., , and . Theor. Comput. Sci., (2015)Vibration optimization of cantilevered bistable composite shells based on machine learning., , , and . Eng. Appl. Artif. Intell., 126 (Part D): 107158 (November 2023)Approximation Algorithms for the Lower-Bounded Knapsack Median Problem., , , and . AAIM, volume 12290 of Lecture Notes in Computer Science, page 119-130. Springer, (2020)A Densely Connected Transformer for Machine Translation., , , , , and . ISCID (1), page 221-224. IEEE, (2019)An LP-Rounding Based Algorithm for a Uniform Capacitated Facility Location Problem with Penalties., and . FAW, volume 12340 of Lecture Notes in Computer Science, page 133-144. Springer, (2020)Local Search Algorithms for k-Median and k-Facility Location Problems with Linear Penalties., , , and . COCOA, volume 9486 of Lecture Notes in Computer Science, page 60-71. Springer, (2015)Approximate the Lower-Bounded Connected Facility Location Problem., , and . COCOON, volume 13025 of Lecture Notes in Computer Science, page 487-498. Springer, (2021)A Complex Semidefinite Programming Rounding Approximation Algorithm for the Balanced Max-3-Uncut Problem., , , and . COCOON, volume 8591 of Lecture Notes in Computer Science, page 324-335. Springer, (2014)An Improved Semidefinite Programming Hierarchies Rounding Approximation Algorithm for Maximum Graph Bisection Problems., , and . COCOON, volume 7936 of Lecture Notes in Computer Science, page 304-315. Springer, (2013)Strategy-Proof Cost-Sharing Mechanism Design for a Generalized Cover-Sets Problem (Extended Abstract)., , , and . CSoNet, volume 11917 of Lecture Notes in Computer Science, page 77-78. Springer, (2019)