Sciweavers

1144 search results - page 7 / 229
» Fractal Algorithm for Finding Global Optimal Solution
Sort
View
ICIP
2005
IEEE
14 years 10 months ago
Finding the global minimum for binary image restoration
Restoring binary images is a problem which arises in various application fields. In our paper, this problem is considered in a variational framework: the sought-after solution min...
Tony F. Chan, Selim Esedoglu, Mila Nikolova
JMLR
2012
11 years 11 months ago
Globally Optimizing Graph Partitioning Problems Using Message Passing
Graph partitioning algorithms play a central role in data analysis and machine learning. Most useful graph partitioning criteria correspond to optimizing a ratio between the cut a...
Elad Mezuman, Yair Weiss
TIP
2002
116views more  TIP 2002»
13 years 8 months ago
Adaptive approximate nearest neighbor search for fractal image compression
Fractal image encoding is a computationally intensive method of compression due to its need to find the best match between image sub-blocks by repeatedly searching a large virtual...
Chong Sze Tong, Man Wong
ASPDAC
2005
ACM
91views Hardware» more  ASPDAC 2005»
13 years 10 months ago
A Min-area Solution to Performance and RLC Crosstalk Driven Global Routing Problem
-- This paper presents a novel global routing algorithm, AT-PO-GR, to minimize the routing area under both congestion, timing, and RLC crosstalk constraints. The proposed algorithm...
Tong Jing, Ling Zhang, Jinghong Liang, Jingyu Xu, ...
GECCO
2007
Springer
157views Optimization» more  GECCO 2007»
14 years 2 months ago
Global multiobjective optimization via estimation of distribution algorithm with biased initialization and crossover
Multiobjective optimization problems with many local Pareto fronts is a big challenge to evolutionary algorithms. In this paper, two operators, biased initialization and biased cr...
Aimin Zhou, Qingfu Zhang, Yaochu Jin, Bernhard Sen...