681 search results - page 51 / 137 » General Polynomial Time Decomposition Algorithms |
114
click to vote
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
In the field of robust optimization, the goal is to provide solutions to combinatorial problems that hedge against variations of the numerical parameters. This constitutes an effor...
120
Voted
ICCAD
2009
IEEE
14 years 10 months ago
2009
IEEE
With the adoption of ultra regular fabric paradigms for controlling design printability at the 22nm node and beyond, there is an emerging need for a layout-driven, pattern-based p...
145
Voted
SODA
2012
ACM
13 years 2 months ago
2012
ACM
Bidimensionality theory was introduced by Demaine et al. [JACM 2005 ] as a framework to obtain algorithmic results for hard problems on minor closed graph classes. The theory has ...
98
Voted
COMPGEOM
2007
ACM
15 years 4 months ago
2007
ACM
For polytopes P, Q Rd we consider the intersection P Q; the convex hull of the union CH(P Q); and the Minkowski sum P + Q. We prove that given rational H-polytopes P1, P2, Q it...
82
Voted
COLT
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. We consider the problem of learning an acyclic discrete circuit with n wires, fan-in bounded by k and alphabet size s using value injection queries. For the class of tran...