322 search results - page 23 / 65 » Counting Dependence Predictors |
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We prove general exponential moment inequalities for averages of [0,1]valued iid random variables and use them to tighten the PAC Bayesian Theorem. The logarithmic dependence on t...
ASPLOS
1992
ACM
15 years 1 months ago
1992
ACM
The foremost goal of superscalar processor design is to increase performance through the exploitation of instruction-level parallelism (ILP). Previous studies have shown that spec...
EMNLP
2008
14 years 11 months ago
2008
This paper introduces a new kernel which computes similarity between two natural language sentences as the number of paths shared by their dependency trees. The paper gives a very...
PROMISE
2010
14 years 4 months ago
2010
Background: Previous research has provided evidence that a combination of static code metrics and software history metrics can be used to predict with surprising success which fil...
HPCA
2008
IEEE
15 years 10 months ago
2008
IEEE
Hard-to-predict branches depending on longlatency cache-misses have been recognized as a major performance obstacle for modern microprocessors. With the widening speed gap between...