16666 search results - page 30 / 3334 » Descriptive and Computational Complexity |
122
click to vote
JCSS
2006
15 years 3 months ago
2006
This paper studies sequence prediction based on the monotone Kolmogorov complexity Km=-log m, i.e. based on universal deterministic/one-part MDL. m is extremely close to Solomonof...
141
click to vote
SMA
2003
ACM
15 years 8 months ago
2003
ACM
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
JELIA
2004
Springer
15 years 8 months ago
2004
Springer
Boolean games are a class of two-player games which may be defined via a Boolean form over a set of atomic actions. A particular game on some form is instantiated by partitioning ...
143
Voted
MST
2011
14 years 10 months ago
2011
Hierarchical graph definitions allow a modular description of graphs using modules for the specification of repeated substructures. Beside this modularity, hierarchical graph de...
113
Voted
DIS
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. The Minimum Description Length (MDL) is an informationtheoretic principle that can be used for model selection and other statistical inference tasks. One way to implement...