AI Networking Cookbook: Practical recipes for AI-assisted network automation and development
We have 2 of 82 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
We study the maximum coverage problem for geometric set systems: given a set of points, a set of geometric objects, and a number $k$, select $k$ objects maximizing the number of points inside their union. - We present a polynomial-time approximation algorithm with approximation factor strictly better than $1-1/e$ for a...
This approach integrates a classic grid-based partition framework with a novel charging analysis that controls the cost of structure-sensitive offline routines within each cell, to perform a global aggregation of the update time, by circumventing the worst-case costs associated with individual cell updates.
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.