… by learning the weights associated with anchors in a supervised way; 2) and we are able
to compute more efficiently by just matching images assigned to the same anchors. We first …

… distributions in a Reproducing Kernel Hilbert Space (RKHS) [6… Kernel Mean Matching
procedure by appealing to the method … efficient approach to address the above scalability …

… This includes the Efficient Match Kernel (EMK) which involves the projection of local
descriptors onto random Gaussian directions followed by a cosine non-linearity [14], or second-…

… dynamic match kernel by adaptively calculating the matching thresholds … In contrast to the
typical static match kernel which is … As a result, the proposed method is still efficient for retrieval …

… For the computation of heat kernels we used 500 Laplacian eigenfunctions. We provide
comparisons with complete matching pipelines as well as with learning-based approaches, …

… For the computation of heat kernels we used 500 Laplacian eigenfunctions. We provide
comparisons with complete matching pipelines as well as with learning-based approaches, …

… This section first describes the class of match kernels that we will analyze in this paper. This
… We adopt this method only with the binarized representation for scalability and efficiency …

… Efficient match kernel [1] is a popular choice in applications … In efficient match kernel, all
elements of the sets are mapped … , in particular many efficient match kernels benefit from AFM. …

… on how to schedule workloads to share GPU by multiple concurrent workloads efficiently. …
to a graph matching problem, we adopt maximum weight graph matching algorithm. We …

… 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 …