260 search results - page 28 / 52 » Degree constrained subgraphs |
COLOGNETWENTE
2009
13 years 8 months ago
2009
Given a graph G = (V, E), a proper vertex colouring of V is t-frugal if no colour appears more than t times in any neighbourhood and is acyclic if each of the bipartite graphs con...
ICASSP
2007
IEEE
14 years 1 months ago
2007
IEEE
Abstract— This work considers a combination classificationregression based framework with the proposal of using learned kernels in modified support vector regression to provide...
ICRA
2005
IEEE
14 years 1 months ago
2005
IEEE
— Classical visual servoing approaches tend to constrain all degrees of freedom (DOF) of the robot during the execution of a task. In this article a new approach is proposed. The...
GC
2007
Springer
13 years 7 months ago
2007
Springer
We localize and strengthen Katona’s idea of an edge-toughness to a local topological toughness. We disprove a conjecture of Katona concerning the connection between edgetoughnes...
ICRA
2002
IEEE
14 years 10 days ago
2002
IEEE
In this paper, a teleoperation controller is proposed for a pair of nonlinear master and slave manipulators. The control law enables the nonlinear robots to be perfectly coordinate...