Sciweavers

6045 search results - page 32 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Non-linear feature extraction by linear PCA using local kernel
This paper presents how to extract non-linear features by linear PCA. KPCA is effective but the computational cost is the drawback. To realize both non-linearity and low computati...
Kazuhiro Hotta
CVPR
2008
IEEE
14 years 9 months ago
Approximate earth mover's distance in linear time
The earth mover's distance (EMD) [16] is an important perceptually meaningful metric for comparing histograms, but it suffers from high (O(N3 log N)) computational complexity...
Sameer Shirdhonkar, David W. Jacobs
CG
2006
Springer
13 years 11 months ago
Computing Proper Equilibria of Zero-Sum Games
We show that a proper equilibrium of a matrix game can be found in polynomial time by solving a linear (in the number of pure strategies of the two players) number of linear progra...
Peter Bro Miltersen, Troels Bjerre Sørensen
CVPR
2009
IEEE
15 years 3 months ago
What is a Camera?
This paper addresses the problem of characterizing a general class of cameras under reasonable, “linear” assumptions. Concretely, we use the formalism and terminology of cla...
Jean Ponce (Ecole Normale Superieure)
CEC
2005
IEEE
14 years 1 months ago
XCS with computed prediction for the learning of Boolean functions
Computed prediction represents a major shift in learning classifier system research. XCS with computed prediction, based on linear approximators, has been applied so far to functi...
Pier Luca Lanzi, Daniele Loiacono, Stewart W. Wils...