Vorapong Suppakitpaisarn
Vorapong Suppakitpaisarn
Verified email at - Homepage
Cited by
Cited by
Semimetric properties of s°rensen-dice and tversky indexes
A Gragera, V Suppakitpaisarn
International Workshop on Algorithms and Computation, 339-350, 2016
Adaptive probabilistic caching technique for caching networks with dynamic content popularity
S Tarnoi, W Kumwilaisak, V Suppakitpaisarn, K Fukuda, Y Ji
Computer Communications 139, 1-15, 2019
Segment routed traffic engineering with bounded stretch in software-defined networks
T Settawatcharawanit, V Suppakitpaisarn, S Yamada, Y Ji
2018 IEEE 43rd Conference on Local Computer Networks (LCN), 477-480, 2018
Relaxed triangle inequality ratio of the S°rensen–Dice and Tversky indexes
A Gragera, V Suppakitpaisarn
Theoretical Computer Science 718, 37-45, 2018
An approximation algorithm for multiroute flow decomposition
V Suppakitpaisarn
Electronic Notes in Discrete Mathematics 52, 367-374, 2016
Maximum lifetime coverage problems with battery recovery effects
N Fu, V Suppakitpaisarn, K Kimura, N Kakimura
2014 IEEE Global Communications Conference, 118-124, 2014
A (k+ 1)-approximation robust network flow algorithm and a tighter heuristic method using iterative multiroute flow
JF Baffier, V Suppakitpaisarn
International Workshop on Algorithms and Computation, 68-79, 2014
Improved localization accuracy using machine learning: Predicting and refining rss measurements
CL Nguyen, O Georgiou, V Suppakitpaisarn
2018 IEEE Globecom Workshops (GC Wkshps), 1-7, 2018
Maximum lifetime coverage problem with battery recovery effect
N Fu, N Kakimura, K Kimura, V Suppakitpaisarn
Sustainable Computing: Informatics and Systems 18, 1-13, 2018
Performance analysis of probabilistic caching scheme using markov chains
S Tarnoi, V Suppakitpaisarn, W Kumwilaisak, Y Ji
2015 IEEE 40th Conference on Local Computer Networks (LCN), 46-54, 2015
Speeding up algorithm for maximizing barrier coverage using parametric multiroute flow
V Suppakitpaisarn, JF Baffier
IEICE Communications Express 4 (4), 111-116, 2015
Parametric Multiroute Flow and Its Application to Robust Network with Edge Failures
JF Baffier, V Suppakitpaisarn, H Hiraishi, H Imai
International Symposium on Combinatorial Optimization, 26-37, 2014
Fastest multi-scalar multiplication based on optimal double-base chains
V Suppakitpaisarn, H Imai, E Masato
World Congress on Internet Security (WorldCIS-2012), 93-98, 2012
Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials
K Phalakarn, V Suppakitpaisarn, N Attrapadung, K Matsuura
International Conference on Cryptology in India, 763-785, 2020
On the minimal Hamming weight of a multi-base representation
D Krenn, V Suppakitpaisarn, S Wagner
Journal of Number Theory 208, 168-179, 2020
A computation-efficient approach for segment routing traffic engineering
T Settawatcharawanit, YH Chiang, V Suppakitpaisarn, Y Ji
IEEE Access 7, 160408-160417, 2019
Adaptive Probabilistic Caching for Information-Centric Networking
S Tarnoi, V Suppakitpaisarn, Y Ji
IEICE Technical Report; IEICE Tech. Rep. 115 (210), 63-68, 2015
Robust network flow against attackers with knowledge of routing method
V Suppakitpaisarn, W Dai, JF Baffier
2015 IEEE 16th International Conference on High Performance Switching andá…, 2015
Worst Case Computation Time for Minimal Joint Hamming Weight Numeral Systems
V Suppakitpaisarn
Numerical Computations: Theory and Algorithms, 134, 2013
Fast elliptic curve cryptography using minimal weight conversion of d integers
V Suppakitpaisarn, M Edahiro, H Imai
Proceedings of the Tenth Australasian Information Security Conference-Volumeá…, 2012
The system can't perform the operation now. Try again later.
Articles 1–20