Sciweavers

48 search results - page 6 / 10
» Simulated Annealing for Graph Bisection
Sort
View
ECCV
2006
Springer
14 years 9 months ago
Statistical Priors for Efficient Combinatorial Optimization Via Graph Cuts
Abstract. Bayesian inference provides a powerful framework to optimally integrate statistically learned prior knowledge into numerous computer vision algorithms. While the Bayesian...
Daniel Cremers, Leo Grady
UIST
1994
ACM
13 years 11 months ago
Evolutionary Learning of Graph Layout Constraints from Examples
We propose a new evolutionary method of extracting user preferences from examples shown to an automatic graph layout system. Using stochastic methods such as simulated annealing a...
Toshiyuki Masui
MICCAI
2005
Springer
14 years 8 months ago
Cross Entropy: A New Solver for Markov Random Field Modeling and Applications to Medical Image Segmentation
This paper introduces a novel solver, namely cross entropy (CE), into the MRF theory for medical image segmentation. The solver, which is based on the theory of rare event simulati...
Jue Wu, Albert C. S. Chung
IJMC
2006
84views more  IJMC 2006»
13 years 7 months ago
Using a genetic algorithm approach to solve the dynamic channel-assignment problem
: The Channel Assignment Problem is an NP-complete problem to assign a minimum number of channels under certain constraints to requested calls in a cellular radio system. Examples ...
Xiannong Fu, Anu G. Bourgeois, Pingzhi Fan, Yi Pan
DATE
2009
IEEE
140views Hardware» more  DATE 2009»
14 years 2 months ago
Lifetime reliability-aware task allocation and scheduling for MPSoC platforms
With the relentless scaling of semiconductor technology, the lifetime reliability of embedded multiprocessor platforms has become one of the major concerns for the industry. If th...
Lin Huang, Feng Yuan, Qiang Xu