Sciweavers

1963 search results - page 222 / 393
» The Maximum Solution Problem on Graphs
Sort
View
ICASSP
2008
IEEE
15 years 7 months ago
Determining the parameters in regularized super-resolution reconstruction
We derive a novel method to determine the parameters for regularized super-resolution problems. The proposed approach relies on the Joint Maximum a Posteriori (JMAP) estimation te...
Marcelo Victor Wüst Zibetti, Joceli Mayer, Fe...
96
Voted
GECCO
2003
Springer
15 years 6 months ago
Chromosome Reuse in Genetic Algorithms
This paper introduces a novel genetic algorithm strategy based on the reuse of chromosomes from previous generations in the creation of offspring individuals. A number of chromoso...
Adnan Acan, Yüce Tekol
GLOBECOM
2009
IEEE
15 years 4 months ago
Power Efficient Traffic Grooming in Optical WDM Networks
Abstract--Power-awareness in networking attracts more attention as the trends in the energy consumption of the Internet raise growing concerns about the environmental impacts and s...
Emre Yetginer, George N. Rouskas
107
Voted
ICIP
2010
IEEE
14 years 10 months ago
Bayesian regularization of diffusion tensor images using hierarchical MCMC and loopy belief propagation
Based on the theory of Markov Random Fields, a Bayesian regularization model for diffusion tensor images (DTI) is proposed in this paper. The low-degree parameterization of diffus...
Siming Wei, Jing Hua, Jiajun Bu, Chun Chen, Yizhou...
IJCAI
2003
15 years 2 months ago
Continuous nonlinear dimensionality reduction by kernel Eigenmaps
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
Matthew Brand