Optimal Amnesic Probabilistic Automata or How to Learn and Classify Proteins in Linear Time and Space

doi 10.1145/332306.332321
Full Text
Abstract

Available in full text

Date
Authors
Publisher

ACM Press

Related search

How to Learn a Conceptual Space

Behavioral and Brain Sciences
PhysiologyPhysiological PsychologyNeuropsychologyBehavioral Neuroscience
2005English

On Weighted Time-Optimal Control for Linear Hybrid Automata Using Quantifier Elimination

IFAC Proceedings Volumes
2004English

Statistical Approximation of Optimal Schedulers for Probabilistic Timed Automata

Lecture Notes in Computer Science
Computer ScienceTheoretical Computer Science
2016English

Space-Time Linear Dispersion Codes Based on Optimal Algorithms

2009English

Stochastic Machines and Probabilistic Automata.

English

Learn With SAT to Minimize Büchi Automata

Electronic Proceedings in Theoretical Computer Science, EPTCS
Software
2012English

How to Classify N? （Original Article）

Journal of Japanese Society of Oral Oncology
2016English

Deciding Probabilistic Simulation Between Probabilistic Pushdown Automata and Finite-State Systems

Information and Computation
Theoretical Computer ScienceComputational TheoryComputer Science ApplicationsInformation SystemsMathematics
2019English

Vecalign: Improved Sentence Alignment in Linear Time and Space

2019English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy