16 citations · 27 across the 15 of their papers we have counts for
16 papers
Subdomain-aware representation compression for pretrained image embeddings
Poowanut Niamluang, Jittat Fakcharoenphol
Dimensionality reduction is a well-known technique for improving space efficiency, typically applied uniformly across an entire dataset. This paper investigates the possibilities o…
An Improved Linear Extractable Sketch Data Structure for Flow Count Statistics
Patthadon Tantiameorn, Grittin Nuntasombat, Jittat Fakcharoenphol
Sketch data structures are very useful for computing statistics on streaming data, including network traffic, server requests, and financial transactions. In recent work, FermatSke…
Covering Planar Lattices with Interior-Disjoint Unit Disks
Nattawut Phetmak, Grittin Nuntasombat, Jittat Fakcharoenphol
We study an infinite variant of the coin-covering problem for periodic point sets in the plane. Given a point set of spacing , we ask whether all of its points can be covered by…
Robust Bichromatic Classification in 3D Using Planes and Slices
Grittin Nuntasombat, Nattawut Phetmak, Jittat Fakcharoenphol
Given two sets of points in 3-dimensional space and , we want to separate these two sets of points using a classifier based on linear constraints, while ensuring robustness…
An Improved PTAS for Covering Targets with Mobile Sensors
Nonthaphat Wongwattanakij, Nattawut Phetmak, Chaiporn Jaikaeo +1
This paper considers a movement minimization problem for mobile sensors. Given a set of point targets, the -Sink Minimum Movement Target Coverage Problem is to schedule mobi…
Stochastic Contextual Bandits with Graph-based Contexts
Jittat Fakcharoenphol, Chayutpong Prompak
We naturally generalize the on-line graph prediction problem to a version of stochastic contextual bandit problems where contexts are vertices in a graph and the structure of the g…
Folding Every Point on a Polygon Boundary to a Point
Nattawut Phetmak, Jittat Fakcharoenphol
We consider a problem in computational origami. Given a piece of paper as a convex polygon and a point located within, fold every point on a boundary of to and comp…
Retraction: Improved Approximation Schemes for Dominating Set Problems in Unit Disk Graphs
Jittat Fakcharoenphol, Pattara Sukprasert
Retraction note: After posting the manuscript on arXiv, we were informed by Erik Jan van Leeuwen that both results were known and they appeared in his thesis[vL09]. A PTAS for MDS…
A PTAS for -hop MST on the Euclidean plane: Improving Dependency on
Jittat Fakcharoenphol, Nonthaphat Wongwattanakij
For any , Laue and Matijević [CCCG'07, IPL'08] give a PTAS for finding a -approximate solution to the -hop MST problem in the Euclidean plane that runs in time $(n/ε…
Fair Resource Allocation for Demands with Sharp Lower Tail Inequalities
Vacharapat Mettanant, Jittat Fakcharoenphol
We consider a fairness problem in resource allocation where multiple groups demand resources from a common source with the total fixed amount. The general model was introduced by E…
Bandit Multiclass Linear Classification for the Group Linear Separable Case
Jittat Fakcharoenphol, Chayutpong Prompak
We consider the online multiclass linear classification under the bandit feedback setting. Beygelzimer, Pál, Szörényi, Thiruvenkatachari, Wei, and Zhang [ICML'19] considered two no…
Learning Network Structures from Contagion
Adisak Supeesun, Jittat Fakcharoenphol
In 2014, Amin, Heidari, and Kearns proved that tree networks can be learned by observing only the infected set of vertices of the contagion process under the independent cascade mo…
Finding All Useless Arcs in Directed Planar Graphs
Jittat Fakcharoenphol, Bundit Laekhanukit, Pattara Sukprasert
We present a linear-time algorithm for simplifying flow networks on directed planar graphs: Given a directed planar graph on vertices, a source vertex and a sink vertex …
A simpler load-balancing algorithm for range-partitioned data in peer-to-peer systems
Jakarin Chawachat, Jittat Fakcharoenphol
Random hashing is a standard method to balance loads among nodes in Peer-to-Peer networks. However, hashing destroys locality properties of object keys, the critical properties to…
Faster Algorithms for Semi-Matching Problems
Jittat Fakcharoenphol, Bundit Laekhanukit, Danupon Nanongkai
We consider the problem of finding \textit{semi-matching} in bipartite graphs which is also extensively studied under various names in the scheduling literature. We give faster alg…
Low congestion online routing and an improved mistake bound for online prediction of graph labeling
Jittat Fakcharoenphol, Boonserm Kijsirikul
In this paper, we show a connection between a certain online low-congestion routing problem and an online prediction of graph labeling. More specifically, we prove that if there ex…