Recent studies on deep convolutional neural networks present a simple paradigm of architecture design, i.e., models with more MACs typically achieve better accuracy, such as EfficientNet and RegNet. These works try to enlarge all the stages in the mo...
We show that the Adaptive Greedy algorithm of Golovin and Krause (2011) achieves an approximation bound of $(\ln (Q/η)+1)$ for Stochastic Submodular Cover: here $Q$ is the "goal value" and $η$ is the smallest non-zero marginal increase in utility d...
# Mega Earth: imperialists, greedy, and blasphemously wearing the veil of democracy The Meaf are the armed forces of Mega Earth, an alternate dimension version of super earth that never experienced ...
Motivated by Kleinberg's (2000) and subsequent work, we consider the performance of greedy routing on a directed ring of $n$ nodes augmented with long-range contacts. In this model, each node $u$ is given an additional $D_u$ edges, a degree chosen fr...
Your All-in-One Learning Portal. It contains well written, well thought and well explained computer science and programming articles, quizzes and practice/competitive programming/company interview Questions.