Abstract. We cast the problem of motion segmentation of feature trajectories as linear manifold finding problems and propose a general framework for motion segmentation under affin...
Abstract. In this paper we present new concurrent and recoverable B-link-tree algorithms. Unlike previous algorithms, ours maintain the balance of the B-link tree at all times, so ...
Ibrahim Jaluta, Seppo Sippu, Eljas Soisalon-Soinin...
ite Web service designed based on abstract Web services, which define only interfaces, allows an application developer to select services required for his application only by set...
Abstract — Regularized block diagonalization (RBD) is a new linear precoding technique for the multi-antenna broadcast channel and has a significantly improved sum rate and dive...
Abstract —Previous work demonstrated that the improvements in spectral efficiency and link reliability can be obtained in wireless relay networks employing terminals with MIMO c...