198 search results - page 3 / 40 » Evidence-invariant Sensitivity Bounds |
PLDI
1993
ACM
13 years 11 months ago
1993
ACM
This paper shows how to software pipeline a loop for minimal register pressure withoutsacrificing the loop’s minimum execution time. This novel bidirectional slack-scheduling m...
NIPS
2001
13 years 8 months ago
2001
We present a new approach to bounding the true error rate of a continuous valued classifier based upon PAC-Bayes bounds. The method first constructs a distribution over classifier...
DAC
1995
ACM
13 years 10 months ago
1995
ACM
Abstract We observe that the switching activity at a circuit node, also called the transition density, can be extremely sensitive to the circuit internal delays. As a result, sligh...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
We describe an efficient parallel algorithm for hiddensurface removal for terrain maps. The algorithm runs in Olog4 n steps on the CREW PRAM model with a work bound of On + kpolyl...
MST
2010
13 years 5 months ago
2010
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...