Results 1 to 10 of about 26 (24)
On-Line Electrocardiogram Lossless Compression Using Antidictionary Codes for a Finite Alphabet
IEICE Transactions on Information and Systems, 2010 An antidictionary is particularly useful for data compression, and on-line electrocardiogram (ECG) lossless compression algorithms using antidictionaries have been proposed. They work in real-time with constant memory and give better compression ratios than traditional lossless data compression algorithms, while they only deal with ECG data on a binary
Hiroyoshi Morita, Takahiro Ota
exaly +3 more sources
Polynomial languages with finite antidictionaries [PDF]
RAIRO - Theoretical Informatics and Applications, 2008 Summary: We tackle the problem of studying which kind of functions can occur as complexity functions of formal languages of a certain type. We prove that an important narrow subclass of rational languages contains languages of polynomial complexity of any integer degree over any non-trivial alphabet.
openaire +4 more sources
Missing value replacement in strings and applications. [PDF]
Data Min Knowl DiscovBernardini G +6 more
europepmc +1 more source
Some of the next articles are maybe not open access.
Lecture Notes in Computer Science, 2013
We study FAD-languages, which are regular languages defined by finite sets of forbidden factors, together with their “canonical” recognizing automata. We are mainly interested in the possible asymptotic orders of growth for such languages. We analyze certain simplifications of sets of forbidden factors and show that they “almost” preserve the canonical
Arseny M Shur
exaly +3 more sources
We study FAD-languages, which are regular languages defined by finite sets of forbidden factors, together with their “canonical” recognizing automata. We are mainly interested in the possible asymptotic orders of growth for such languages. We analyze certain simplifications of sets of forbidden factors and show that they “almost” preserve the canonical
Arseny M Shur
exaly +3 more sources
LANGUAGES WITH A FINITE ANTIDICTIONARY: SOME GROWTH QUESTIONS
International Journal of Foundations of Computer Science, 2014We study FAD-languages, which are regular languages defined by finite sets of forbidden factors, together with their “canonical” recognizing automata. We are mainly interested in the possible asymptotic orders of growth for such languages. We analyze certain simplifications of sets of forbidden factors and show that they “almost” preserve the ...
openaire +3 more sources
A Compact Tree Representation of an Antidictionary
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2017Hiroyoshi Morita, Takahiro Ota
exaly
Dynamic construction of an antidictionary with linear complexity
Theoretical Computer Science, 2014Hiroyoshi Morita, Takahiro Ota
exaly
Antidictionary-Based Cardiac Arrhythmia Classification For Smart ECG sensors
2022Antoine Frappé, Benoit Larras
exaly
Real-Time and Memory-Efficient Arrhythmia Detection in ECG Monitors Using Antidictionary Coding
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, 2013Hiroyoshi Morita +2 more
exaly
Arrhythmia Detection with Antidictionary Coding and Its Application on Mobile Platforms
Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, 2019Hiroyoshi Morita, Takahiro Ota
exaly