3044 search results - page 265 / 609 » Linear logical approximations |
190
click to vote
SODA
2008
ACM
15 years 8 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
180
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
In this paper we consider the capacitated vertex cover problem which is the variant of vertex cover where each node is allowed to cover a limited number of edges. We present an ef...
156
click to vote
DATE
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper presents an efficient approach to compute the dominant poles for the reduced-order admittance (Y parameter) matrix of lossy interconnects. Using the global approximati...
180
click to vote
ASYNC
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper introduces a novel technique for synthesis of speed-independent circuits from their Signal Transition Graph specifications. The new method uses partial order in the fo...
191
click to vote
LICS
2010
IEEE
15 years 4 months ago
2010
IEEE
We prove that fixed-point logic with counting captures polynomial time on all classes of graphs with excluded minors. That is, for every class C of graphs such that some graph H is...