क्यूआर कोड

Algorithmic Relative Complexity

Information content and compression are tightly related concepts that can be addressed through both classical and algorithmic information theories, on the basis of Shannon entropy and Kolmogorov complexity, respectively. The definition of several entities in Kolmogorov’s framework relies upon ideas...

पूर्ण विवरण

में बचाया:
मुख्य लेखकों: Daniele Cerra, Mihai Datcu
स्वरूप: Artigo
भाषा:Inglês
प्रकाशित: MDPI AG 2011-04-01
श्रृंखला:Entropy
विषय:
Kolmogorov complexity
compression
relative entropy
Kullback-Leibler divergence
similarity measure
compression based distance
ऑनलाइन पहुंच:http://www.mdpi.com/1099-4300/13/4/902/
टैग: टैग जोड़ें
कोई टैग नहीं, इस रिकॉर्ड को टैग करने वाले पहले व्यक्ति बनें!

समान संसाधन