We prove that the edges of every graph of bounded (Euler) genus can be partitioned into any prescribed number k of pieces such that contracting any piece results in a graph of bou...
Erik D. Demaine, MohammadTaghi Hajiaghayi, Bojan M...
Traditional classification methods assume that the training and the test data arise from the same underlying distribution. However, in several adversarial settings, the test set is...
Prepaid customers in mobile telecommunications are not bound by a contract and can therefore change operators (`churn') at their convenience and without notification. This mak...
Dejan Radosavljevik, Peter van der Putten, Kim Kyl...
— Many modern computer vision algorithms are built atop of a set of low-level feature operators (such as SIFT [1], [2]; HOG [3], [4]; or LBP [5], [6]) that transform raw pixel va...
Recent computer vision approaches are aimed at richer image interpretations that extend the standard recognition of objects in images (e.g., cars) to also recognize object attribu...
William Curran, Travis Moore, Todd Kulesza, Weng-K...