Amanote Research
Register
Sign In
Tree Representations via Ordinal Machines
Computability
- Netherlands
doi 10.3233/com-2012-002
Full Text
Open PDF
Abstract
Available in
full text
Categories
Theoretical Computer Science
Computational Theory
Computer Science Applications
Artificial Intelligence
Mathematics
Date
January 1, 2012
Authors
Philipp Schlicht
Benjamin Seyfferth
Publisher
IOS Press
Related search
Tree Automata Make Ordinal Theory Easy
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
Pose Machines: Articulated Pose Estimation via Inference Machines
Lecture Notes in Computer Science
Computer Science
Theoretical Computer Science
A Tree-Based Method for Modeling a Multivariate Ordinal Response
Statistics and its Interface
Applied Mathematics
Statistics
Probability
Do Hypercubes Sort Faster Than Tree Machines?
Concurrency: Practice and Experience
On Improving the Performance of Tree Machines
International Journal of High Speed Computing
Universal Asymptotics in Committee Machines With Tree Architecture
Contractions of Group Representations via Geometric Quantization
Letters in Mathematical Physics
Nonlinear Physics
Mathematical Physics
Statistical
Irredundant Sequential Machines via Optimal Logic Synthesis
Spatiotemporal Pattern Recognition via Liquid State Machines
