Sciweavers

4432 search results - page 583 / 887
» Solving Demodulation as an Optimization Problem
Sort
View
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
15 years 6 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 7 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
ICCV
2009
IEEE
16 years 8 months ago
Constrained Clustering by Spectral Kernel Learning
Clustering performance can often be greatly improved by leveraging side information. In this paper, we consider constrained clustering with pairwise constraints, which specify s...
Zhenguo Li, Jianzhuang Liu
97
Voted
CVPR
2008
IEEE
16 years 5 months ago
Misalignment-robust face recognition
In this paper, we study the problem of subspace-based face recognition under scenarios with spatial misalignments and/or image occlusions. For a given subspace, the embedding of a...
Huan Wang, Shuicheng Yan, Thomas S. Huang, Jianzhu...
ICCV
2007
IEEE
16 years 5 months ago
A Matte-less, Variational Approach to Automatic Scene Compositing
In this paper, we consider the problem of compositing a scene from multiple images. Multiple images, for example, can be obtained by varying the exposure of the camera, by changin...
Shanmuganathan Raman, Subhasis Chaudhuri