In this paper, we address the matrix completion problem and propose a novel algorithm based on a smoothed rank function (SRF) approximation. Among available algorithms like FPCA a...
Abstract The performance of stochastic optimisers can be assessed experimentally on given problems by performing multiple optimisation runs, and analysing the results. Since an opt...
Viviane Grunert da Fonseca, Carlos M. Fonseca, And...
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
Emad A. El-Sebakhy, Salahadin Mohammed, Moustafa E...
This paper presents a simple but powerful extension of the maximum margin clustering (MMC) algorithm that optimizes multivariate performance measure specifically defined for clust...
Based on the observation that it is relatively easier for users to generate several good transfer functions (TFs) for different features of volumetric data, we propose TF fusing, ...
Yingcai Wu, Huamin Qu, Hong Zhou, Ming-Yuen Cha...