no code implementations • 31 Jan 2022 • Michael Shekelyan, Grigorios Loukides
Second, this new generalized mechanism is paired with a canonical loss function to obtain the canonical Lipschitz mechanism, which can directly select k-subsets out of $d$ items in $O(dk+d \log d)$ time.
1 code implementation • 18 Jan 2021 • Leqian Zheng, Hau Chan, Grigorios Loukides, Minming Li
Last, we demonstrate experimentally that the greedy algorithms are effective in sensor placement and influence maximization problems.
