Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.
EDBT 2026 Demo / reviewers in the wild / expert

Miomir S. Stankovic

dblp:66/2098 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 2013
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 2Theory of computation · 2

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
2 papers
Information theory · 61% Coding theory · 26% Distributed computing theory · 13%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Information theory › information measures
entropy		 0.322013
Comments on "Generalization of Shannon-Khinchin Axioms to Nonextensive Systems and the Uniqueness Theorem for the Nonextensive Entropy" · IEEE Trans. Inf. Theory 2013
Entropy Message Passing · IEEE Trans. Inf. Theory 2011
Information theory › information measures › entropy › generalized entropy
nonextensive entropy		 0.212013
Comments on "Generalization of Shannon-Khinchin Axioms to Nonextensive Systems and the Uniqueness Theorem for the Nonextensive Entropy" · IEEE Trans. Inf. Theory 2013
Coding theory › error-correcting codes › decoding › iterative decoding
belief propagation		 0.112011
Entropy Message Passing · IEEE Trans. Inf. Theory 2011
Information theory › information measures › entropy
entropy approximation		 0.112011
Entropy Message Passing · IEEE Trans. Inf. Theory 2011
Coding theory › error-correcting codes › decoding › iterative decoding
factor graphs		 0.112011
Entropy Message Passing · IEEE Trans. Inf. Theory 2011
Distributed computing theory
message passing		 0.112011
Entropy Message Passing · IEEE Trans. Inf. Theory 2011

Methods — techniques the papers use, named apart from their topics

counterexample · 0.2axiomatic derivation · 0.2gradient descent · 0.1expectation-maximization · 0.1entropy semiring · 0.1
YearPublicationVenuePosition
2013 Comments on "Generalization of Shannon-Khinchin Axioms to Nonextensive Systems and the Uniqueness Theorem for the Nonextensive Entropy"
abstract
In this comment, we consider a generalization of the Shannon–Khinchin axioms (GSK axioms) and the uniqueness theorem for the entropy determined by GSK axioms proposed in [H. Suyari, IEEE Trans. Inf. Theory, vol. 50, pp. 1783–1787, Aug. 2004]. It is shown that the class of entropy functions determined by the axioms from the mentioned paper is wider than the one proposed in this paper, and a counterexample is given. We also derive a new class of entropies by fixing the incorrectness which occurs in the mentioned paper.
Velimir M. Ilic, Miomir S. Stankovic, Edin H. Mulalic
 IEEE Trans. Inf. Theory2
2012 Gradient computation in linear-chain conditional random fields using the entropy message passing algorithm
Velimir M. Ilic, Dejan I. Mancev, Branimir Todorovic, Miomir S. Stankovic
 Pattern Recognit. Lett.4
2011 Entropy Message Passing
abstract
The paper proposes a new message passing algorithm for cycle-free factor graphs. The proposed "entropy message passing" (EMP) algorithm may be viewed as sum-product message passing over the entropy semiring, which has previously appeared in automata theory. The primary use of EMP is to compute the entropy of a model. However, EMP can also be used to compute expressions that appear in expectation maximization and in gradient-descent algorithms.
Velimir M. Ilic, Miomir S. Stankovic, Branimir Todorovic
 IEEE Trans. Inf. Theory2
2002 Extended Kalman Filter Trained Recurrent Radial Basis Function Network in Nonlinear System Identification
Branimir Todorovic, Miomir S. Stankovic, Claudio Moraga
 ICANN2