3415 search results - page 267 / 683 » Lower bounds on kernelization |
175
click to vote
ICCAD
1997
IEEE
15 years 11 months ago
1997
IEEE
This paper presents an efficient approach to perform global interconnect sizing and spacing (GISS) for multiple nets to minimize interconnect delays with consideration of couplin...
145
click to vote
JC
2007
15 years 6 months ago
2007
Let q ≥ 1 be an integer, Sq denote the unit sphere embedded in the Euclidean space Rq+1, and µq be its Lebesgue surface measure. We establish upper and lower bounds for sup f...
209
click to vote
ECCC
2011
15 years 1 months ago
2011
Locally decodable codes are error correcting codes with the extra property that, in order to retrieve the correct value of just one position of the input with high probability, it...
202
click to vote
DAC
2004
ACM
16 years 7 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
291
Voted
ICLP
2009
Springer
16 years 7 months ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...