1578 search results - page 168 / 316 » Algorithmic randomness of continuous functions |
ALT
2003
Springer
14 years 6 months ago
2003
Springer
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
SODA
2010
ACM
14 years 6 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
COMPGEOM
1994
ACM
14 years 1 months ago
1994
ACM
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
EVOW
2009
Springer
14 years 3 months ago
2009
Springer
The Learnable Evolution Model (LEM) involves alternating periods of optimization and learning, performa extremely well on a range of problems, a specialises in achieveing good resu...