A temporal constraint language is a set of relations that has a first-order definition in (Q, <), the dense linear order of the rational numbers. We present a complete comple...
An edge-colored graph G is rainbow edge-connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connection of a connected graph G, deno...
Abstract This paper investigates simple and robust transparency-attainable control architectures for bilateral teleoperation. The strength of two-channel control architectures and ...
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
We propose a new algorithm for simultaneous localization and figure-ground segmentation where coupled region-edge shape priors are involved with two different but complementary ...