Hieu Dinh

According to our database, Hieu Dinh authored at least 17 papers between 2007 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2022

Deep Reinforcement Learning-based Offloading for Latency Minimization in 3-tier V2X Networks.

Hieu Dinh, Nang Hung Nguyen, Trung Thanh Nguyen, Thanh-Hung Nguyen, Truong Thao Nguyen, Phi Le Nguyen

Proceedings of the IEEE Wireless Communications and Networking Conference, 2022

2021

Multi-Agent Multi-Armed Bandit Learning for Offloading Delay Minimization in V2X Networks.

Nang Hung Nguyen, Phi Le Nguyen, Hieu Dinh, Thanh-Hung Nguyen, Kien Nguyen

Proceedings of the 19th IEEE International Conference on Embedded and Ubiquitous Computing, 2021

2014

Border Length Minimization Problem on a Square Array.

Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh

J. Comput. Biol., 2014

2012

Fault Localization Using Passive End-to-End Measurements and Sequential Testing for Wireless Sensor Networks.

Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati

IEEE Trans. Mob. Comput., 2012

An Efficient Algorithm for Chinese Postman Walk on Bi-Directed de Bruijn Graphs.

Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh

Discret. Math. Algorithms Appl., 2012

Sniffer channel selection for monitoring wireless LANs.

Xian Chen, Yoo-Ah Kim, Bing Wang, Yuan Song, Hieu Dinh, Guanling Chen

Comput. Commun., 2012

Poster: Randomized algorithms for planted Motif Search.

Jerlin C. Merlin, Hieu Dinh

Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

Workshop: An efficient data structure for exact-match overlap graphs and next generation sequence assembly.

Hieu Dinh, Sanguthevar Rajasekaran

Proceedings of the IEEE 2nd International Conference on Computational Advances in Bio and Medical Sciences, 2012

2011

An Experimental Comparison of PMSPrune and Other Algorithms for Motif Search

Dolly Sharma, Sanguthevar Rajasekaran, Hieu Dinh

CoRR, 2011

PMS5: an efficient exact algorithm for the (l, d)-motif finding problem.

Hieu Dinh, Sanguthevar Rajasekaran, Vamsi Kundeti

BMC Bioinform., 2011

A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.

Hieu Dinh, Sanguthevar Rajasekaran

Bioinform., 2011

Workshop: Efficient sequential and parallel algorithms for sequence assembly.

Sanguthevar Rajasekaran, Hieu Dinh, Vamsi Kundeti

Proceedings of the IEEE 1st International Conference on Computational Advances in Bio and Medical Sciences, 2011

2010

Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs

Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh

CoRR, 2010

Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.

Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh, Matthew Vaughn, Vishal Thapar

BMC Bioinform., 2010

On the border length minimization problem (BLMP) on a square array.

Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh

Proceedings of the First ACM International Conference on Bioinformatics and Computational Biology, 2010

2009

Data Collection with Multiple Sinks in Wireless Sensor Networks.

Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Kim, Bing Wang

Proceedings of the Wireless Algorithms, 2009

2007

SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks.

Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, Bing Wang

Proceedings of the DIALM-POMC International Workshop on Foundations of Mobile Computing, 2007