Sciweavers

185 search results - page 22 / 37
» Solving problems on recursively constructed graphs
Sort
View
CVPR
2008
IEEE
16 years 1 months ago
Interactive image segmentation via minimization of quadratic energies on directed graphs
We propose a scheme to introduce directionality in the Random Walker algorithm for image segmentation. In particular, we extend the optimization framework of this algorithm to com...
Dheeraj Singaraju, Leo Grady, René Vidal
FOCS
1992
IEEE
15 years 3 months ago
Efficient Inference of Partial Types
Partial types for the -calculus were introduced by Thatte in 1988 [3] as a means of typing objects that are not typable with simple types, such as heterogeneous lists and persiste...
Dexter Kozen, Jens Palsberg, Michael I. Schwartzba...
ASPDAC
2006
ACM
116views Hardware» more  ASPDAC 2006»
15 years 5 months ago
Post-routing redundant via insertion for yield/reliability improvement
- Reducing the yield loss due to via failure is one of the important problems in design for manufacturability. A well known and highly recommended method to improve via yield/relia...
Kuang-Yao Lee, Ting-Chi Wang
GECCO
2007
Springer
181views Optimization» more  GECCO 2007»
15 years 6 months ago
ACOhg: dealing with huge graphs
Ant Colony Optimization (ACO) has been successfully applied to those combinatorial optimization problems which can be translated into a graph exploration. Artificial ants build s...
Enrique Alba, J. Francisco Chicano
ISCAS
2003
IEEE
124views Hardware» more  ISCAS 2003»
15 years 5 months ago
Convergent transfer subgraph characterization and computation
In this paper, we present a precise characterization of the existence of a convergent transfer subgraph in an edge colored directed acyclic graph. Based on the characterization, l...
Wing Ning Li