1578 search results - page 157 / 316 » Algorithmic randomness of continuous functions |
UAI
2004
13 years 11 months ago
2004
As real-world Bayesian networks continue to grow larger and more complex, it is important to investigate the possibilities for improving the performance of existing algorithms of ...
IMR
2003
Springer
14 years 3 months ago
2003
Springer
Quadratic elements place stringent requirements on a surface mesh smoother. One of the biggest challenges is that a good linear element may become invalid when mid-side nodes are ...
CVPR
2000
IEEE
15 years 2 days ago
2000
IEEE
?Gibbsian fields or Markov random fields are widely used in Bayesian image analysis, but learning Gibbs models is computationally expensive. The computational complexity is pronoun...
ICML
2008
IEEE
14 years 11 months ago
2008
IEEE
We consider the task of reinforcement learning in an environment in which rare significant events occur independently of the actions selected by the controlling agent. If these ev...
CORR
2008
Springer
13 years 10 months ago
2008
Springer
A string matching--and more generally, sequence matching--algorithm is presented that has a linear worst-case computing time bound, a low worst-case bound on the number of compari...