Amanote Research

Amanote Research

    RegisterSign 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 ScienceComputational TheoryComputer Science ApplicationsArtificial IntelligenceMathematics
Date

January 1, 2012

Authors
Philipp SchlichtBenjamin Seyfferth
Publisher

IOS Press


Related search

Tree Automata Make Ordinal Theory Easy

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2006English

A Tree-Based Method for Modeling a Multivariate Ordinal Response

Statistics and its Interface
Applied MathematicsStatisticsProbability
2008English

Pose Machines: Articulated Pose Estimation via Inference Machines

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2014English

On Improving the Performance of Tree Machines

International Journal of High Speed Computing
1995English

Do Hypercubes Sort Faster Than Tree Machines?

Concurrency: Practice and Experience
1994English

Universal Asymptotics in Committee Machines With Tree Architecture

1999English

Irredundant Sequential Machines via Optimal Logic Synthesis

English

Contractions of Group Representations via Geometric Quantization

Letters in Mathematical Physics
Nonlinear PhysicsMathematical PhysicsStatistical
2019English

Spatiotemporal Pattern Recognition via Liquid State Machines

English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2025 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy