Suivre
Vorapong Suppakitpaisarn
Vorapong Suppakitpaisarn
Adresse e-mail validée de is.s.u-tokyo.ac.jp - Page d'accueil
Titre
Citée par
Citée par
Année
Semimetric properties of sørensen-dice and tversky indexes
A Gragera, V Suppakitpaisarn
International Workshop on Algorithms and Computation, 339-350, 2016
212016
Relaxed triangle inequality ratio of the Sørensen–Dice and Tversky indexes
A Gragera, V Suppakitpaisarn
Theoretical Computer Science 718, 37-45, 2018
192018
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
162019
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
152018
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
142018
A computation-efficient approach for segment routing traffic engineering
T Settawatcharawanit, YH Chiang, V Suppakitpaisarn, Y Ji
IEEE Access 7, 160408-160417, 2019
102019
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
102012
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
92018
Maximum lifetime coverage problems with battery recovery effects
N Fu, V Suppakitpaisarn, K Kimura, N Kakimura
2014 IEEE Global Communications Conference, 118-124, 2014
92014
An approximation algorithm for multiroute flow decomposition
V Suppakitpaisarn
Electronic Notes in Discrete Mathematics 52, 367-374, 2016
82016
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
82014
A Voronoi-based method for land-use optimization using semidefinite programming and gradient descent algorithm
V Suppakitpaisarn, A Ariyarit, S Chaidee
International Journal of Geographical Information Science 35 (5), 999-1031, 2021
72021
Improving accuracy of differentially private kronecker social networks via graph clustering
A Paul, V Suppakitpaisarn, M Bafna, CP Rangan
2020 International Symposium on Networks, Computers and Communications …, 2020
72020
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
72015
On the minimal Hamming weight of a multi-base representation
D Krenn, V Suppakitpaisarn, S Wagner
Journal of Number Theory 208, 168-179, 2020
62020
Constructive t-secure Homomorphic Secret Sharing for Low Degree Polynomials
K Phalakarn, V Suppakitpaisarn, N Attrapadung, K Matsuura
Progress in Cryptology–INDOCRYPT 2020: 21st International Conference on …, 2020
62020
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
62015
Speeding up algorithm for maximizing barrier coverage using parametric multiroute flow
V Suppakitpaisarn, JF Baffier
IEICE Communications Express 4 (4), 111-116, 2015
62015
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
62014
PACE solver description: Computing exact treedepth via minimal separators
Z Xu, D Mao, V Suppakitpaisarn
15th International Symposium on Parameterized and Exact Computation (IPEC 2020), 2020
52020
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20