Le Hong Trang

According to our database1, Le Hong Trang authored at least 19 papers between 2012 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of five.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Clustering helps to improve price prediction in online booking systems.
Int. J. Web Inf. Syst., 2021

A max-conflicts based heuristic search for the stable marriage problem with ties and incomplete lists.
J. Heuristics, 2021

2020
A Comparative Study of the Some Methods Used in Constructing Coresets for Clustering Large Datasets.
SN Comput. Sci., 2020

A shortlist-based bidirectional local search for the stable marriage problem.
J. Exp. Theor. Artif. Intell., 2020

A Farthest First Traversal based Sampling Algorithm for k-clustering.
Proceedings of the 14th International Conference on Ubiquitous Information Management and Communication, 2020

A Convex Optimization Based Method for Color Image Reconstruction.
Proceedings of the Future Data and Security Engineering. Big Data, Security and Privacy, Smart City and Industry 4.0 Applications, 2020

2019
A Max-Min Conflict Algorithm for the Stable Marriage Problem.
Proceedings of the Knowledge Management and Acquisition for Intelligent Systems, 2019

A Searching for Strongly Egalitarian and Sex-Equal Stable Matchings.
Proceedings of the 13th International Conference on Ubiquitous Information Management and Communication, 2019

A Comparative Study of the Use of Coresets for Clustering Large Datasets.
Proceedings of the Future Data and Security Engineering - 6th International Conference, 2019

Scaling Big Data Applications in Smart City with Coresets.
Proceedings of the 8th International Conference on Data Science, 2019

Finding MAX-SMTI for Stable Marriage with Ties and Bounded Preference Lists.
Proceedings of the 2019 International Conference on Advanced Computing and Applications, 2019

2018
A Sample-Based Algorithm for Visual Assessment of Cluster Tendency (VAT) with Large Datasets.
Proceedings of the Future Data and Security Engineering - 5th International Conference, 2018

2017
An Iterative Algorithm for Computing Shortest Paths Through Line Segments in 3D.
Proceedings of the Future Data and Security Engineering - 4th International Conference, 2017

2016
A sequential convex programming algorithm for minimizing a sum of Euclidean norms with non-convex constraints.
Optim. Methods Softw., 2016

An Empirical Local Search for the Stable Marriage Problem.
Proceedings of the PRICAI 2016: Trends in Artificial Intelligence, 2016

Finding "optimal" stable marriages with ties via local search.
Proceedings of the 2016 Eighth International Conference on Knowledge and Systems Engineering, 2016

A Bidirectional Local Search for the Stable Marriage Problem.
Proceedings of the 2016 International Conference on Advanced Computing and Applications, 2016

2014
On the Performance of Triangulation-Based Multiple Shooting Method for 2D Geometric Shortest Path Problems.
Trans. Large Scale Data Knowl. Centered Syst., 2014

2012
A parallel algorithm based on convexity for the computing of Delaunay tessellation.
Numer. Algorithms, 2012


  Loading...