We obtain a polynomial time approximation scheme for the terrain guarding problem improving upon several recent constant factor approximations. Our algorithm is a local search algo...
Matt Gibson, Gaurav Kanade, Erik Krohn, Kasturi R....
– Simple algorithms have been developed in the area of node localization in a wireless sensor network. For these simple algorithms to work, several assumptions were made. However...
Eddie B. S. Tan, Joo Ghee Lim, Winston Khoon Guan ...
The k-means method is an old but popular clustering algorithm known for its observed speed and its simplicity. Until recently, however, no meaningful theoretical bounds were known...
In this paper we study the technology mapping problem of FPGA architectures with dual supply voltages (Vdds) for power optimization. This is done with the guarantee that the mappi...
We formulate a novel problem of summarising entities with limited presentation budget on entity-relationship knowledge graphs and propose an efficient algorithm for solving this pr...
Marcin Sydow, Mariusz Pikula, Ralf Schenkel, Adam ...