Sciweavers

3072 search results - page 5 / 615
» Shape analysis algorithm based on information theory
Sort
View
GECCO
2005
Springer
170views Optimization» more  GECCO 2005»
15 years 3 months ago
Multiobjective shape optimization with constraints based on estimation distribution algorithms and correlated information
A new approach based on Estimation Distribution Algorithms for constrained multiobjective shape optimization is proposed in this article. Pareto dominance and feasibility rules ar...
Sergio Ivvan Valdez Peña, Salvador Botello ...
MICCAI
2007
Springer
15 years 10 months ago
Shape Analysis Using a Point-Based Statistical Shape Model Built on Correspondence Probabilities
A fundamental problem when computing statistical shape models is the determination of correspondences between the instances of the associated data set. Often, homologies between po...
Heike Hufnagel, Xavier Pennec, Jan Ehrhardt, Heinz...
SIGIR
2009
ACM
15 years 4 months ago
Portfolio theory of information retrieval
This paper studies document ranking under uncertainty. It is tackled in a general situation where the relevance predictions of individual documents have uncertainty, and are depen...
Jun Wang, Jianhan Zhu
JDCTA
2010
228views more  JDCTA 2010»
14 years 4 months ago
Research and Progress of Cluster Algorithms based on Granular Computing
Granular Computing (GrC), a knowledge-oriented computing which covers the theory of fuzzy information granularity, rough set theory, the theory of quotient space and interval comp...
Shifei Ding, Li Xu, Hong Zhu, Liwen Zhang
ICASSP
2008
IEEE
15 years 4 months ago
Insights into the stable recovery of sparse solutions in overcomplete representations using network information theory
In this paper, we examine the problem of overcomplete representations and provide new insights into the problem of stable recovery of sparse solutions in noisy environments. We es...
Yuzhe Jin, Bhaskar D. Rao