83 search results - page 13 / 17 » Improved Cut Sequences for Partitioning Based Placement |
ECCV
2008
Springer
14 years 8 months ago
2008
Springer
There are many local and greedy algorithms for energy minimization over Markov Random Field (MRF) such as iterated condition mode (ICM) and various gradient descent methods. Local ...
GECCO
2003
Springer
14 years 3 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
VLSM
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. Given an image, digital matting consists in extracting a foreground element from the background. Standard methods are initialized with a trimap, a partition of the image ...
BMCBI
2010
13 years 10 months ago
2010
Background: Solving bioinformatics tasks often requires extensive computational power. Recent trends in processor architecture combine multiple cores into a single chip to improve...
MMS
2002
13 years 9 months ago
2002
In a distributed environment, the presentation of structured, composite multimedia information poses new challenges in dealing with variable bandwidth (BW) requirements and synchro...