Add to ORKGInternational audienceWe propose a classification test to discriminate Markov sources based on the joint string complexity. String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we define the joint string complexity as the cardinality of the set of words which both strings have in common. In this paper we analyze the average joint complexity when both strings are generated by two Markov sources. We provide fast converging asymptotic expansions and present some experimental results showing usefulness of the joint complexity to text discrimination
Abstract. Assume a tuple of words x ̄ = 〈x1,..., xn 〉 has negligible mu-tual information with anoth...
This paper considers the average complexity of maximum likelihood (ML) decoding of convolutional cod...
International audienceWe describe a multiple string pattern matching algorithm which is well-suited ...
International audienceWe propose a classification test to discriminate Markov sources based on the j...
String complexity is defined as the cardinality of a set of all distinct words (factors) of a given ...
International audienceIn this paper we study joint sequence complexity and its applications for find...
AbstractThe basic theory of hidden Markov models was developed and applied to problems in speech rec...
International audienceIn this paper we introduce a novel method to perform topic detection in Twitte...
AbstractIn this paper we study the average behavior of the number of distinct substrings in a text o...
The hidden Markov model (HMM) has been widely used in signal processing and digital communication ap...
The goal of this paper is the creation of a Markov chain text classification algorithm deriving from...
In the distributed coding of correlated sources, the problem of characterizing the joint probability...
We consider sets of strings with high Kolmogorov complexity, mainly in resource-bounded settings but...
In this paper we define a generalized, two-parameter, Kolmogorov complexity of finite strings which...
Recent work has considered encoding a string by separately conveying its symbols and its pattern—the...
Abstract. Assume a tuple of words x ̄ = 〈x1,..., xn 〉 has negligible mu-tual information with anoth...
This paper considers the average complexity of maximum likelihood (ML) decoding of convolutional cod...
International audienceWe describe a multiple string pattern matching algorithm which is well-suited ...
International audienceWe propose a classification test to discriminate Markov sources based on the j...
String complexity is defined as the cardinality of a set of all distinct words (factors) of a given ...
International audienceIn this paper we study joint sequence complexity and its applications for find...
AbstractThe basic theory of hidden Markov models was developed and applied to problems in speech rec...
International audienceIn this paper we introduce a novel method to perform topic detection in Twitte...
AbstractIn this paper we study the average behavior of the number of distinct substrings in a text o...
The hidden Markov model (HMM) has been widely used in signal processing and digital communication ap...
The goal of this paper is the creation of a Markov chain text classification algorithm deriving from...
In the distributed coding of correlated sources, the problem of characterizing the joint probability...
We consider sets of strings with high Kolmogorov complexity, mainly in resource-bounded settings but...
In this paper we define a generalized, two-parameter, Kolmogorov complexity of finite strings which...
Recent work has considered encoding a string by separately conveying its symbols and its pattern—the...
Abstract. Assume a tuple of words x ̄ = 〈x1,..., xn 〉 has negligible mu-tual information with anoth...
This paper considers the average complexity of maximum likelihood (ML) decoding of convolutional cod...
International audienceWe describe a multiple string pattern matching algorithm which is well-suited ...