… By proving that all the calculations in Orthogonal Match Pursuit (OMP… Kernel OMP (KOMP).
The proposed algorithm outperforms other sparse representation solvers in terms of efficiency …

… We consider the context of match kernels. An image is typically described by … efficient match
kernels [23], which converges slowly with the number of components. Efficient match kernels …

… In this paper, we propose a fast graph kernel, the descriptor matching (DM) kernel, for … we
now discuss how to define a kernel k to efficiently measure the similarity of their corresponding …

… match kernel to compute the similarity of the two shapes. We hope to solve the problem in
considerable generality. Shapes are arbitrary 2D figures, eg derived from edges extracted …

… of the kernel PCA representation can be accomplished very efficiently using a set of …
applicability of the approach for efficient history matching while providing a reasonable reproduction …

… We then consider the mismatch kernel problem with feature selection, and present efficient
… , we propose novel and efficient algorithms for solving the string kernel-based learning …

… This approach was mentioned in transfer learning for fairness [19], but has not previously
been studied as a core bias mitigation technique; we analyze here its efficiency and practical …

… 4.3 Efficient Computation All the kernels we define above can be efficiently computed using
a trie data structure, similar to the mismatch tree approach first presented in Leslie et al. (…

We propose a fast event retrieval method in video databases based on temporal match
kernel. The basic idea of the baseline is to maximize the score function for all possible relative …

… from efficient match kernels (EMK) that combine the strengths of both bag of words and
set kernels. Hence EMK can be used in conjunction with linear classifiers instead of kernel …