1326 search results - page 169 / 266 » Approximate Tree Kernels |
117
Voted
SAC
2009
ACM
15 years 9 months ago
2009
ACM
This paper proposes a novel recombination scheme for evolutionary algorithms, which can guide the new population generation towards the maximum increase of the objective function....
164
click to vote
SCALESPACE
2009
Springer
15 years 9 months ago
2009
Springer
From an image we construct an invertible orientation score, which provides an overview of local orientations in an image. This orientation score is a function on the group SE(2) of...
121
click to vote
COMGEO
2007
ACM
15 years 2 months ago
2007
ACM
In this paper we present a package for implementing exact kinetic data structures built on objects which move along polynomial trajectories. We discuss how the package design was ...
103
click to vote
PAMI
2006
15 years 2 months ago
2006
Gaussian process classifiers (GPCs) are Bayesian probabilistic kernel classifiers. In GPCs, the probability of belonging to a certain class at an input location is monotonically re...
146
click to vote
TNN
2008
15 years 2 months ago
2008
Abstract--Large-margin methods, such as support vector machines (SVMs), have been very successful in classification problems. Recently, maximum margin discriminant analysis (MMDA) ...