Sciweavers

1963 search results - page 46 / 393
» The Maximum Solution Problem on Graphs
Sort
View
ICASSP
2011
IEEE
13 years 12 days ago
A segmentation method for textured images based on the maximum posterior mode criterion
We consider the problem of semi-supervised segmentation of textured images. Recently, reweighted belief propagation has been introduced as a solution for Bayesian inference with r...
Frédéric Lehmann
ENDM
2008
93views more  ENDM 2008»
13 years 8 months ago
The Generalized Max-Controlled Set Problem
In this work we deal with sandwich graphs G = (V, E) and present the notion of vertices f-controlled by a subset M V . We introduce the generalized maxcontrolled set problem (gmc...
Ivairton M. Santos, Carlos A. J. Martinhon, Luiz S...
ALGORITHMICA
2011
13 years 3 months ago
All-Pairs Bottleneck Paths in Vertex Weighted Graphs
Let G = (V, E, w) be a directed graph, where w : V → R is an arbitrary weight function defined on its vertices. The bottleneck weight, or the capacity, of a path is the smalles...
Asaf Shapira, Raphael Yuster, Uri Zwick
CORR
2010
Springer
106views Education» more  CORR 2010»
13 years 8 months ago
Symmetry within Solutions
We define the concept of an internal symmetry. This is a symmety within a solution of a constraint satisfaction problem. We compare this to solution symmetry, which is a mapping b...
Marijn Heule, Toby Walsh
ICCAD
2001
IEEE
201views Hardware» more  ICCAD 2001»
14 years 5 months ago
An Integrated Data Path Optimization for Low Power Based on Network Flow Method
Abstract: We propose an effective algorithm for power optimization in behavioral synthesis. In previous work, it has been shown that several hardware allocation/binding problems fo...
Chun-Gi Lyuh, Taewhan Kim, Chien-Liang Liu