142 search results - page 23 / 29 » Approximate maximum weight branchings |
110
Voted
ICCAD
2004
IEEE
15 years 10 months ago
2004
IEEE
Traditional timing-driven placement considers only combinational delays and does not take into account the potential of subsequent sequential optimization steps. As a result, the ...
129
click to vote
STOC
1990
ACM
15 years 5 months ago
1990
ACM
ions (Extended Abstract) Noga Alon Paul Seymour Robin Thomas Let G be an n-vertex graph with nonnegative weights whose sum is 1 assigned to its vertices, and with no minor isomorp...
134
Voted
NIPS
2007
15 years 3 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
121
click to vote
ICCD
2002
IEEE
15 years 10 months ago
2002
IEEE
We represent switching activity in VLSI circuits using a graphical probabilistic model based on Cascaded Bayesian Networks (CBN’s). We develop an elegant method for maintaining ...
124
click to vote
FSTTCS
2007
Springer
15 years 8 months ago
2007
Springer
We study several cost coloring problems, where we are given a graph and a cost function on the independent sets and are to find a coloring that minimizes the function costs of the...