In this paper, we describe an algorithm to measure the shape complexity for discrete approximations of planar curves in 2D images and manifold surfaces for 3D triangle meshes. We ...
Andreas Koschan, Besma Roui-Abidi, David L. Page, ...
"The aim of this book is to present the strongest possible version of
G¨odel's incompleteness theorem, using an information-theoretic approach
based on the size of com...
The need to merge multiple sources of uncertain information is an important issue in many application areas, especially when there is potential for contradictions between sources. ...
We investigate the problem of routing connections with QoS requirements across one or more networks, when the information available for making routing decisions is inaccurate and ...
Two philosophical applications of the concept of program-size complexity are discussed. First, we consider the light program-size complexity sheds on whether mathematics is invent...