16666 search results - page 330 / 3334 » Descriptive and Computational Complexity |
175
click to vote
MFCS
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. What is information? Frequently spoken about in many contexts, yet nobody has ever been able to define it with mathematical rigor. The best we are left with so far is th...
213
click to vote
ORDER
2010
15 years 5 months ago
2010
Embedding a partially ordered set into a product of chains is a classical way to encode it. Such encodings have been used in various fields such as object oriented programming or ...
192
click to vote
TCS
2011
15 years 1 months ago
2011
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
143
click to vote
ICPR
2000
IEEE
15 years 11 months ago
2000
IEEE
This paper describes a new approach to the analysis of Poisson point processes, in time (1D) or space (2D), which is based on the minimum description length (MDL) framework. Speci...
164
click to vote
COMPLEX
2009
Springer
16 years 1 months ago
2009
Springer
This paper recognises that comparisons have been made between the role of the conductor of an orchestra and leaders of enterprises, but that little note has been taken of how the c...