The deletion–contraction algorithm is perhaps the most popular method for computing a host of fundamental graph invariants such as the chromatic, flow, and reliability polynomi...
— The basic operation of Delay Tolerant Mobile Sensor Network (DTMSN) is for pervasive data gathering in networks with intermittent connectivity, where traditional data gathering...
Jinqi Zhu, Jiannong Cao, Ming Liu, Yuan Zheng, Hai...
In this paper, we design linear time algorithms to recognize and determine topological invariants such as genus and homology groups in 3D. These invariants can be used to identify...
Large-scale digitization projects aimed at periodicals often have as input streams of completely unlabeled document images. In such situations, the results produced by the automat...
Iuliu Vasile Konya, Christoph Seibert, Sebastian G...
— The time domain passivity framework is attracting interest as a method for granting stability in both telerobotics and haptic contexts; this paper employs this approach in orde...