212 search results - page 3 / 43 » Body degree zero |
RSA
2000
14 years 9 months ago
2000
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...
104
click to vote
PERVASIVE
2004
Springer
15 years 2 months ago
2004
Springer
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...
STACS
2009
Springer
15 years 2 months ago
2009
Springer
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 ...
88
Voted
CPC
2007
14 years 9 months ago
2007
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...
74
Voted
CDC
2010
IEEE
14 years 4 months ago
2010
IEEE
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...