We propose a mathematical model that integrates user behavior into ad scheduling and demonstrate how to schedule ads near-optimally to maximize engagement and rewards.
[PDF]
We introduce a new graph parameter called DAG treedepth and design constant-space, divide-and-conquer algorithms for counting subgraph patterns in degenerate graphs. Our results include faster algorithms, structural insights, and a characterization of graphs with DAG treedepth upto two.
[PDF]
In this work, we give a simple PTAS for weighted k-means using weighted D2-sampling. As an application of this result, we also obtain PTAS for the sensor covering problem.
[PDF]
We show that the cost of GREEDY on flat initial tree and Permutation initial tree is the same for all permutation search sequence S.
[PDF]
ICALP 2024
We introduce the Group Access bound, a generalization of the access lemma. As application of the Group access bound we are able to show results that cannot be shown via the access lemma such as : √ log n- competitiveness, k-finger bound, Unified bound, Unified bound with a time window, all with some additive term. We also show that there is a BST algorithm named GGreedy (very similar to Greedy) that achieves this bound.
[PDF]
SODA'23, HALG'23
There is a class of Binary search trees (Greedy BST) that is nearly optimal for sequences such as Deque, Sequential, Preorder, Postorder, k-increasing/k-decreasing, and Split.
[PDF]
[PDF]
This project allows controlling electronic devices in a home remotely from a mobile phone. The system uses DTMF tones detected from a receiver mobile phone connected to a circuit board that decodes the tones and operates relays connected to devices like fans, TVs and lights. When buttons on a transmitter mobile phone are pressed, the corresponding DTMF tones trigger the appropriate relays through decoding and logic circuits on the board. The project aims to provide remote control of appliances using mobile phones for convenience and automation.
[PDF]