113 search results - page 7 / 23 » When can a graph form an orthogonal polyhedron |
RAS
2002
13 years 7 months ago
2002
: This paper presents a new path-tracking scheme for a car-like mobile robot based on neural predictive control. A multi-layer back-propagation neural network is employed to model ...
PAMI
2010
13 years 5 months ago
2010
—In this work, we address the problem of performing class-specific unsupervised object segmentation, i.e., automatic segmentation without annotated training images. Object segmen...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
Many NP-hard problems can be solved efficiently when the input is restricted to graphs of bounded tree-width or clique-width. In particular, by the celebrated result of Courcelle,...
BIRTHDAY
2005
Springer
14 years 27 days ago
2005
Springer
The paper introduces a novel approach to the synthesis of labelled transition systems for calculi with name mobility. The proposal is based on a graphical encoding: Each process is...
IJICT
2007
13 years 7 months ago
2007
We propose a parallel algorithm for dynamic slicing of distributed Java programs. Given a distributed Java program, we first construct an intermediate representation in the form o...