1416 search results - page 163 / 284 » The Kernel Least-Mean-Square Algorithm |
139
click to vote
AAECC
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Commutative semifields in odd characteristic can be equivalently described by planar functions (also known as PN functions). We describe a method to construct a semifield...
195
click to vote
ACCV
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. Compared with the color histogram, where the position information of each pixel is ignored, a simplified color correlogram (SCC) representation encodes the spatial inform...
151
click to vote
NIPS
2007
15 years 7 months ago
2007
Incorporating invariances into a learning algorithm is a common problem in machine learning. We provide a convex formulation which can deal with arbitrary loss functions and arbit...
174
click to vote
NIPS
2000
15 years 7 months ago
2000
We present an improvement of Noviko 's perceptron convergence theorem. Reinterpreting this mistakebound as a margindependent sparsity guarantee allows us to give a PAC{style ...
164
click to vote
ESA
2010
Springer
15 years 7 months ago
2010
Springer
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...