Sciweavers

148 search results - page 3 / 30
» Linear reductions of maximum matching
Sort
View
EUROGP
2003
Springer
119views Optimization» more  EUROGP 2003»
13 years 11 months ago
Maximum Homologous Crossover for Linear Genetic Programming
We introduce a new recombination operator, the Maximum Homologous Crossover for Linear Genetic Programming. In contrast to standard crossover, it attempts to preserve similar struc...
Michael Defoin-Platel, Manuel Clergue, Philippe Co...
PAMI
2006
114views more  PAMI 2006»
13 years 5 months ago
Nonparametric Supervised Learning by Linear Interpolation with Maximum Entropy
Nonparametric neighborhood methods for learning entail estimation of class conditional probabilities based on relative frequencies of samples that are "near-neighbors" of...
Maya R. Gupta, Robert M. Gray, Richard A. Olshen
DC
2011
12 years 5 months ago
Distributed algorithms for covering, packing and maximum weighted matching
Abstract This paper gives poly-logarithmic-round, distributed δ-approximation algorithms for covering problems with submodular cost and monotone covering constraints (Submodular-c...
Christos Koufogiannakis, Neal E. Young
PAMI
2008
162views more  PAMI 2008»
13 years 5 months ago
Dimensionality Reduction of Clustered Data Sets
We present a novel probabilistic latent variable model to perform linear dimensionality reduction on data sets which contain clusters. We prove that the maximum likelihood solution...
Guido Sanguinetti
ICPR
2004
IEEE
14 years 6 months ago
Linear Discriminant Analysis and Discriminative Log-linear Modeling
We discuss the relationship between the discriminative training of Gaussian models and the maximum entropy framework for log-linear models. Observing that linear transforms leave ...
Daniel Keysers, Hermann Ney