In this paper we present HUND, a hypergraph-based unsymmetric nested dissection ordering algorithm for reducing the fill-in incurred during Gaussian elimination. HUND has several i...
Laura Grigori, Erik G. Boman, Simplice Donfack, Ti...
The Lasso is a popular technique for joint estimation and continuous variable selection, especially well-suited for sparse and possibly under-determined linear regression problems....
In the theory of compressed sensing, restricted isometry analysis has become a standard tool for studying how efficiently a measurement matrix acquires information about sparse an...
— We present a new algorithm for solving the global localization problem called Frozen-Time Smoother (FTS). Time is ‘frozen’, in the sense that the belief always refers to th...
In recent years, sparse representation originating from signal compressed sensing theory has attracted increasing interest in computer vision research community. However, to our b...