ABSTRACT. We study the algorithmic complexity of lattice problems based on Ajtai-Kumar-Sivakumar sieving technique [AKS01]. Given a k-dimensional subspace M ⊆ Rn and a full rank ...
In this paper, we develop algorithms for robust linear regression by leveraging the connection between the problems of robust regression and sparse signal recovery. We explicitly ...
The conventional mean shift algorithm has been known to be sensitive to selecting a bandwidth. We present a robust mean shift algorithm with heterogeneous node weights that come f...
Abstract. The usage of Conformal Geometric Algebra leads to algorithms that can be formulated in a very clear and easy to grasp way. But it can also increase the performance of an ...
Abstract— We present an efficient algorithm for power allocation and bit loading in multi-user OFDM system. We starts with the close-form optimum power solution based on ideal c...