We present a simple and intuitive method for encapsulating part of agents’ steering and coordinating abilities into a new class of agents, called situation agents. Situation age...
Matthew Schuerman, Shawn Singh, Mubbasir Kapadia, ...
The Lov´asz theta number of a graph G can be viewed as a semidefinite programming relaxation of the stability number of G. It has recently been shown that a copositive strengthe...
Given a graph G we consider the problem of preprocessing it so that given two vertices x,y and a set X of vertices, we can efficiently report the shortest path (or just its length...
In this paper, we present a new Adaptive Scale Kernel Consensus (ASKC) robust estimator as a generalization of the popular and state-of-the-art robust estimators such as RANSAC (R...
—Adapting the hyperparameters of support vector machines (SVMs) is a challenging model selection problem, especially when flexible kernels are to be adapted and data are scarce....