Sciweavers

399 search results - page 66 / 80
» A Comparative Study of Methods for Transductive Transfer Lea...
Sort
View
MIA
2010
170views more  MIA 2010»
13 years 2 months ago
Linear intensity-based image registration by Markov random fields and discrete optimization
We propose a framework for intensity-based registration of images by linear transformations, based on a discrete Markov Random Field (MRF) formulation. Here, the challenge arises ...
Darko Zikic, Ben Glocker, Oliver Kutter, Martin Gr...
BIOINFORMATICS
2011
13 years 2 months ago
All-atom knowledge-based potential for RNA structure prediction and assessment
Motivation: Over the recent years, the vision that RNA simply serves as information transfer molecule has dramatically changed. The study of the sequence/structure/function relati...
Emidio Capriotti, Tomás Norambuena, Marc A....
ICML
2009
IEEE
14 years 2 months ago
Non-monotonic feature selection
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
Zenglin Xu, Rong Jin, Jieping Ye, Michael R. Lyu, ...
GECCO
2009
Springer
134views Optimization» more  GECCO 2009»
14 years 8 days ago
Estimating the distribution and propagation of genetic programming building blocks through tree compression
Shin et al [19] and McKay et al [15] previously applied tree compression and semantics-based simplification to study the distribution of building blocks in evolving Genetic Progr...
Robert I. McKay, Xuan Hoai Nguyen, James R. Cheney...
AAAI
2008
13 years 10 months ago
Sparse Projections over Graph
Recent study has shown that canonical algorithms such as Principal Component Analysis (PCA) and Linear Discriminant Analysis (LDA) can be obtained from graph based dimensionality ...
Deng Cai, Xiaofei He, Jiawei Han