843 search results - page 51 / 169 » A Graph-cut Based Algorithm For Approximate Mrf Optimization |
116
click to vote
MP
2006
15 years 1 months ago
2006
Given an undirected graph G = (V;E) and three speci ed terminal nodes t1;t2;t3, a 3-cut is a subset A of E such that no two terminals are in the same component of GnA. If a non-neg...
126
click to vote
ISPD
2009
ACM
15 years 8 months ago
2009
ACM
As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignmen...
126
click to vote
DAC
2010
ACM
15 years 5 months ago
2010
ACM
System optimization techniques based on dynamic voltage scaling (DVS) are widely used with the aim of reducing processor energy consumption. Inter-task DVS assigns the same voltag...
IPL
2002
15 years 1 months ago
2002
This paper deals with the problem of constructing a Hamiltonian cycle of optimal weight, called TSP. We show that TSP is 2/3-differential approximable and can not be differential a...
142
click to vote
FOCS
2005
IEEE
15 years 7 months ago
2005
IEEE
We give a general technique to obtain approximation mechanisms that are truthful in expectation. We show that for packing domains, any α-approximation algorithm that also bounds ...