Aerial lidar data classification using adaboost
SK Lodha, DM Fitzpatrick… - … Conference on 3-D …, 2007 - ieeexplore.ieee.org
We use the AdaBoost algorithm to classify 3D aerial lidar scattered height data into four
categories: road, grass, buildings, and trees. To do so we use five features: height, height …
categories: road, grass, buildings, and trees. To do so we use five features: height, height …
The calculus of codes-From entropy, complexity, and information to life
Exploring the core components that define living systems and their operational mechanisms
within emerging biological entities is a complex endeavor. In the realm of biological systems …
within emerging biological entities is a complex endeavor. In the realm of biological systems …
The ghost in the quantum Turing machine
S Aaronson - arXiv preprint arXiv:1306.0159, 2013 - arxiv.org
In honor of Alan Turing's hundredth birthday, I unwisely set out some thoughts about one of
Turing's obsessions throughout his life, the question of physics and free will. I focus relatively …
Turing's obsessions throughout his life, the question of physics and free will. I focus relatively …
Algorithmic statistics: forty years later
N Vereshchagin, A Shen - … and Complexity: Essays Dedicated to Rodney …, 2016 - Springer
Algorithmic statistics has two different (and almost orthogonal) motivations. From the
philosophical point of view, it tries to formalize how the statistics works and why some …
philosophical point of view, it tries to formalize how the statistics works and why some …
Quantifying the rise and fall of complexity in closed systems: the coffee automaton
S Aaronson, SM Carroll, L Ouellette - arXiv preprint arXiv:1405.6903, 2014 - arxiv.org
In contrast to entropy, which increases monotonically, the" complexity" or" interestingness" of
closed systems seems intuitively to increase at first and then decrease as equilibrium is …
closed systems seems intuitively to increase at first and then decrease as equilibrium is …
Undecidability and irreducibility conditions for open-ended evolution and emergence
S Hernández-Orozco, F Hernández-Quiroz… - Artificial …, 2018 - ieeexplore.ieee.org
Is undecidability a requirement for open-ended evolution (OEE)? Using methods derived
from algorithmic complexity theory, we propose robust computational definitions of open …
from algorithmic complexity theory, we propose robust computational definitions of open …
Effective complexity and its relation to logical depth
Effective complexity measures the information content of the regularities of an object. It has
been introduced by Gell-Mann and Lloyd to avoid some of the disadvantages of Kolmogorov …
been introduced by Gell-Mann and Lloyd to avoid some of the disadvantages of Kolmogorov …
[HTML][HTML] Algorithmic probability-guided machine learning on non-differentiable spaces
We show how complexity theory can be introduced in machine learning to help bring
together apparently disparate areas of current research. We show that this model-driven …
together apparently disparate areas of current research. We show that this model-driven …
Computational life: How well-formed, self-replicating programs emerge from simple interaction
The fields of Origin of Life and Artificial Life both question what life is and how it emerges
from a distinct set of" pre-life" dynamics. One common feature of most substrates where life …
from a distinct set of" pre-life" dynamics. One common feature of most substrates where life …
[PDF][PDF] Incorporating Algorithmic Information Theory into Fundamental Concepts of Computational Creativity.
T Mondol, DG Brown - ICCC, 2021 - computationalcreativity.net
Can we attribute creativity to an artifact by examining its computational history? What can be
said about its value and novelty if the artifact is computationally laborious and interesting …
said about its value and novelty if the artifact is computationally laborious and interesting …