1132 search results - page 85 / 227 » Upper and lower Ramsey bounds in bounded arithmetic |
162
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
With aggressive scaling down of feature sizes in VLSI fabrication, process variation has become a critical issue in designs. We show that two necessary conditions for the "Ma...
142
click to vote
VMV
2008
15 years 7 months ago
2008
We propose an adaptive decomposition algorithm to compute separation distances between arbitrarily shaped objects. Using the Gilbert-JohnsonKeerthi algorithm (GJK), we search for ...
148
click to vote
TIT
2011
15 years 1 months ago
2011
—This work first presents a general technique to compute tight upper and lower bounds on the information rate of a multiuser Rayleigh fading channel with no Channel State Inform...
144
click to vote
SIAMFM
2011
14 years 9 months ago
2011
We consider model-free pricing of digital options, which pay out if the underlying asset has crossed both upper and lower barriers. We make only weak assumptions about the underly...
161
click to vote
COCO
2009
Springer
16 years 29 days ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...