Sciweavers

127 search results - page 9 / 26
» Some Solutions for Peer-to-Peer Global Computing
Sort
View
ICCV
2011
IEEE
12 years 8 months ago
Perturb-and-MAP Random Fields: Using Discrete Optimization\\to Learn and Sample from Energy Models
We propose a novel way to induce a random field from an energy function on discrete labels. It amounts to locally injecting noise to the energy potentials, followed by finding t...
George Papandreou, Alan L. Yuille
CEC
2007
IEEE
14 years 2 months ago
Memetic algorithms for inexact graph matching
—The noise-robust matching of two graphs is a hard combinatorial problem with practical importance in several domains. In practical applications, a unique solution for a given in...
Thomas Bärecke, Marcin Detyniecki
SCALESPACE
2007
Springer
14 years 2 months ago
Fuzzy Region Competition: A Convex Two-Phase Segmentation Framework
This paper introduces a new framework for two-phase image segmentation, namely the Fuzzy Region Competition. A generic formulation is developed that extends in a convex way several...
Benoit Mory, Roberto Ardon
ICVGIP
2004
13 years 10 months ago
On Learning Shapes from Shades
Shape from Shading (SFS) is one of the most extensively studied problems in Computer Vision. However, most of the approaches only deal with Lambertian or other specific shading mo...
Subhajit Sanyal, Mayank Bansal, Subhashis Banerjee...
ICCAD
2009
IEEE
106views Hardware» more  ICCAD 2009»
13 years 6 months ago
An efficient pre-assignment routing algorithm for flip-chip designs
The flip-chip package is introduced for modern IC designs with higher integration density and larger I/O counts. In this paper, we consider the pre-assignment flip-chip routing pr...
Po-Wei Lee, Chung-Wei Lin, Yao-Wen Chang, Chin-Fan...