The disjoint paths problem asks, given an graph G and k + 1 pairs of terminals (s0, t0), . . . , (sk, tk), whether there are k + 1 pairwise disjoint paths P0, . . . , Pk, such tha...
High order repetitive control has been introduced to overcome performance decay of repetitive control systems under varying frequency of the signals to be tracked/rejected or impro...
Abstract-We study the well known linear consensus algorithm by means of a LQ-type performance cost. We want to understand how the communication topology influences this algorithm. ...
The mainstream adoption of cluster, grid, and most recently cloud computing models have broadened the applicability of parallel programming from scientific communities to
the bus...
We present a robust approach to creating 2.5D building models from aerial LiDAR point clouds. The method is guaranteed to produce crack-free models composed of complex roofs and ve...