The choice number ch(G) of a graph G = (V, E) is the minimum number k such that for every assignment of a list S(v) of at least k colors to each vertex v V , there is a proper ve...
Most gesture recognition systems analyze gestures intended for communication (e.g. sign language) or for command (e.g. navigation in a virtual world). We attempt instead to recogn...
Paul Lukowicz, Jamie A. Ward, Holger Junker, Mathi...
We consider the problem of uniform sampling of points on an algebraic variety. Specifically, we develop a randomized algorithm that, given a small set of multivariate polynomials ...
Let P(G,t) and F(G,t) denote the chromatic and flow polynomials of a graph G. G.D. Birkhoff and D.C. Lewis showed that, if G is a plane near triangulation, then the only zeros of...
Abstract-- This paper extends the method of virtual constraints and hybrid zero dynamics, developed for rigid robots with a single degree of underactuation, to MABEL, a planar bipe...
Koushil Sreenath, Hae-Won Park, Ioannis Poulakakis...