Hieu Dinh

21 papers B 1C 1Journal 12Unranked 7
YearRankTypeTitle / Venue / Authors
2022 B conf
Deep Reinforcement Learning-based Offloading for Latency Minimization in 3-tier V2X Networks.
WCNC
Hieu Dinh, Nang Hung Nguyen, Trung Thanh Nguyen, Thanh-Hung Nguyen, Truong Thao Nguyen, Phi Le Nguyen
2021 C conf
Multi-Agent Multi-Armed Bandit Learning for Offloading Delay Minimization in V2X Networks.
EUC
Nang Hung Nguyen, Phi Le Nguyen, Hieu Dinh, Thanh-Hung Nguyen, Kien Nguyen
2014 J jnl
Border Length Minimization Problem on a Square Array.
J. Comput. Biol.
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
2012 J jnl
An Efficient Algorithm for Chinese Postman Walk on Bi-Directed de Bruijn Graphs.
Discret. Math. Algorithms Appl.
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
2012 J jnl
Fault Localization Using Passive End-to-End Measurements and Sequential Testing for Wireless Sensor Networks.
IEEE Trans. Mob. Comput.
Bing Wang, Wei Wei, Hieu Dinh, Wei Zeng, Krishna R. Pattipati
2012 — conf
Poster: Randomized algorithms for planted Motif Search.
ICCABS
Jerlin C. Merlin, Hieu Dinh
2012 J jnl
Sniffer channel selection for monitoring wireless LANs.
Comput. Commun.
Xian Chen, Yoo-Ah Kim, Bing Wang, Yuan Song, Hieu Dinh, Guanling Chen
2012 — conf
Workshop: An efficient data structure for exact-match overlap graphs and next generation sequence assembly.
ICCABS
Hieu Dinh, Sanguthevar Rajasekaran
2011 J jnl
A memory-efficient data structure representing exact-match overlap graphs with application for next-generation DNA assembly.
Bioinform.
Hieu Dinh, Sanguthevar Rajasekaran
2011 J jnl
An Experimental Comparison of PMSPrune and Other Algorithms for Motif Search
CoRR
Dolly Sharma, Sanguthevar Rajasekaran, Hieu Dinh
2011 J jnl
PMS5: an efficient exact algorithm for the (l, d)-motif finding problem.
BMC Bioinform.
Hieu Dinh, Sanguthevar Rajasekaran, Vamsi Kundeti
2011 — conf
Workshop: Efficient sequential and parallel algorithms for sequence assembly.
ICCABS
Sanguthevar Rajasekaran, Hieu Dinh, Vamsi Kundeti
2010 J jnl
A memory-efficient data structure representing exact-match overlap graphs with application for next generation DNA assembly
CoRR
Hieu Dinh, Sanguthevar Rajasekaran
2010 J jnl
An Efficient Algorithm For Chinese Postman Walk on Bi-directed de Bruijn Graphs
CoRR
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
2010 — conf
An Efficient Algorithm for Chinese Postman Walk on Bi-directed de Bruijn Graphs.
COCOA (1)
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
2010 J jnl
Efficient Parallel and Out of Core Algorithms for Constructing Large Bi-directed de Bruijn Graphs
CoRR
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
2010 J jnl
Efficient parallel and out of core algorithms for constructing large bi-directed de Bruijn graphs.
BMC Bioinform.
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh, Matthew Vaughn, Vishal Thapar
2010 J jnl
On the Border Length Minimization Problem (BLMP) on a Square Array
CoRR
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
2010 — conf
On the border length minimization problem (BLMP) on a square array.
BCB
Vamsi Kundeti, Sanguthevar Rajasekaran, Hieu Dinh
2009 — conf
Data Collection with Multiple Sinks in Wireless Sensor Networks.
WASA
Sixia Chen, Matthew Coolbeth, Hieu Dinh, Yoo-Ah Kim, Bing Wang
2007 — conf
SDP-based Approach for Channel Assignment in Multi-radio Wireless Networks.
DIALM-POMC
Hieu Dinh, Yoo Ah Kim, Seungjoon Lee, Minho Shin, Bing Wang