2588 search results - page 414 / 518 » Applications of Kolmogorov complexity to computable model th... |
JACM
2006
14 years 11 months ago
2006
Abstract. Maximum likelihood (ML) is an increasingly popular optimality criterion for selecting evolutionary trees [Felsenstein 1981]. Finding optimal ML trees appears to be a very...
118
click to vote
BMCBI
2006
14 years 11 months ago
2006
Background: The modeling of dynamic systems requires estimating kinetic parameters from experimentally measured time-courses. Conventional global optimization methods used for par...
ICML
2009
IEEE
16 years 17 days ago
2009
IEEE
The promise of unsupervised learning methods lies in their potential to use vast amounts of unlabeled data to learn complex, highly nonlinear models with millions of free paramete...
111
click to vote
CGI
2009
IEEE
15 years 3 months ago
2009
IEEE
Despite the clear benefits that stream and path surfaces bring when visualizing 3D vector fields, their use in both industry and for research has not proliferated. This is due, in...
CORR
2008
Springer
14 years 12 months ago
2008
Springer
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...