1578 search results - page 52 / 316 » Algorithmic randomness of continuous functions |
SPAA
1992
ACM
14 years 3 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...
AUSAI
2005
Springer
14 years 4 months ago
2005
Springer
: In order to scale to problems with large or continuous state-spaces, reinforcement learning algorithms need to be combined with function approximation techniques. The majority of...
CVPR
2007
IEEE
15 years 1 months ago
2007
IEEE
We introduce novel discriminative learning algorithms for dynamical systems. Models such as Conditional Random Fields or Maximum Entropy Markov Models outperform the generative Hi...
STOC
1992
ACM
14 years 3 months ago
1992
ACM
How much can an imperfect source of randomness affect an algorithm? We examine several simple questions of this type concerning the long-term behavior of a random walk on a finite...
BMCBI
2008
13 years 11 months ago
2008
Background: Post translational modifications (PTMs) occur in the vast majority of proteins and are essential for function. Prediction of the sequence location of PTMs enhances the...