2802 search results - page 189 / 561 » Online Learning with Kernels |
199
Voted
NIPS
2004
15 years 8 months ago
2004
A new distance measure between probability density functions (pdfs) is introduced, which we refer to as the Laplacian pdf distance. The Laplacian pdf distance exhibits a remarkabl...
184
click to vote
PAA
2010
15 years 5 months ago
2010
By applying recent results in optimization theory variously known as optimization transfer or majorize/minimize algorithms, an algorithm for binary, kernel, Fisher discriminant ana...
241
click to vote
CVPR
2012
IEEE
13 years 9 months ago
2012
IEEE
The ability to normalize pose based on super-category landmarks can significantly improve models of individual categories when training data are limited. Previous methods have co...
185
click to vote
COLT
1999
Springer
15 years 11 months ago
1999
Springer
This paper proposes the use of constructive ordinals as mistake bounds in the on-line learning model. This approach elegantly generalizes the applicability of the on-line mistake ...
224
click to vote
CF
2008
ACM
15 years 9 months ago
2008
ACM
String searching is the computationally intensive kernel of many security and network applications like search engines, intrusion detection systems, virus scanners and spam filter...