417 search results - page 10 / 84 » Running Time Predictions for Factoring Algorithms |
UAI
2004
14 years 11 months ago
2004
We introduce a probabilistic formalism subsuming Markov random fields of bounded tree width and probabilistic context free grammars. Our models are based on a representation of Bo...
VR
2003
IEEE
15 years 2 months ago
2003
IEEE
We present an experiment comparing double exponential smoothing and Kalman filter-based predictive tracking algorithms with derivative free measurement models. Our results show t...
ANTS
2006
Springer
15 years 1 months ago
2006
Springer
Let P(n) denote the largest prime divisor of n, and let (x, y) be the number of integers n x with P(n) y. In this paper we present improvements to Bernstein's algorithm, whi...
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Research on bias in machine learning algorithms has generally been concerned with the impact of bias on predictive accuracy. We believe that there are other factors that should al...
79
Voted
SPE
1998
14 years 9 months ago
1998
This paper describes some basic experiments to see how fast various popular scripting and user-interface languages run on a spectrum of representative tasks. We found enormous var...