7988 search results - page 1176 / 1598 » A Useful Undecidable Theory |
203
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We propose new succinct representations of ordinal trees, which have been studied extensively. It is known that any n-node static tree can be represented in 2n + o(n) bits and a l...
204
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
164
click to vote
ALT
2004
Springer
16 years 4 months ago
2004
Springer
Rademacher and Gaussian complexities are successfully used in learning theory for measuring the capacity of the class of functions to be learned. One of the most important propert...
182
click to vote
ICCAD
2008
IEEE
16 years 3 months ago
2008
IEEE
— With process variation becoming a growing concern in deep submicron technologies, the ability to efficiently obtain an accurate estimate of failure probability of SRAM compone...
152
click to vote
ICCAD
2006
IEEE
16 years 3 months ago
2006
IEEE
– Identifying worst-case voltage drop conditions in every module supplied by the power grid is a crucial problem in modern IC design. In this paper we develop a novel methodology...