Sciweavers

1326 search results - page 59 / 266
» Approximate Tree Kernels
Sort
View
WDAG
2004
Springer
130views Algorithms» more  WDAG 2004»
15 years 7 months ago
Distributed Weighted Matching
Abstract. In this paper, we present fast and fully distributed algorithms for matching in weighted trees and general weighted graphs. The time complexity as well as the approximati...
Mirjam Wattenhofer, Roger Wattenhofer
107
Voted
MOC
2010
14 years 9 months ago
Convergence analysis of the Jacobi spectral-collocation methods for Volterra integral equations with a weakly singular kernel
In this paper, a Jacobi-collocation spectral method is developed for Volterra integral equations of the second kind with a weakly singular kernel. We use some function transformati...
Yanping Chen, Tao Tang
130
Voted
ICDAR
2009
IEEE
15 years 9 months ago
Fisher Kernels for Handwritten Word-spotting
The Fisher kernel is a generic framework which combines the benefits of generative and discriminative approaches to pattern classification. In this contribution, we propose to a...
Florent Perronnin, José A. Rodríguez...
117
Voted
ICPR
2004
IEEE
16 years 3 months ago
Rapid Spline-based Kernel Density Estimation for Bayesian Networks
The likelihood for patterns of continuous attributes for the naive Bayesian classifier (NBC) may be approximated by kernel density estimation (KDE), letting every pattern influenc...
Boaz Lerner, Yaniv Gurwicz
142
Voted
ICCV
2011
IEEE
14 years 2 months ago
A Graph-matching Kernel for Object Categorization
This paper addresses the problem of category-level image classification. The underlying image model is a graph whose nodes correspond to a dense set of regions, and edges reflec...
Olivier Duchenne, Armand Joulin, Jean Ponce