2714 search results - page 277 / 543 » Approximation Schemes for Scheduling |
128
click to vote
ISBI
2006
IEEE
16 years 4 months ago
2006
IEEE
Magnetic Resonance Imaging with non-Cartesian acquisition schemes suffer from blurring artifacts induced by offresonance. Conventional algorithms for off-resonance correction are ...
115
click to vote
VLSID
2002
IEEE
16 years 4 months ago
2002
IEEE
We propose the redundancy identification of wire replacement faults. The solutions rely on the satisfiability (SAT) formulation of redundancy identification, augmented with the me...
167
click to vote
STOC
2006
ACM
16 years 4 months ago
2006
ACM
Let > 0 be a constant. For any edge-weighted planar graph G and a subset S of nodes of G, there is a subgraph H of G of weight a constant times that of the minimum Steiner tree...
113
click to vote
ICCAD
2006
IEEE
16 years 1 months ago
2006
IEEE
We present the first efficient approach to global routing that takes spacing-dependent costs into account and provably finds a near-optimum solution including these costs. We sh...
128
Voted
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
We prove that the problem of computing an Arrow-Debreu market equilibrium is PPAD-complete even when all traders use additively separable, piecewise-linear and concave utility fun...