![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Velimir M. Ilic
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j5]Velimir M. Ilic, Ivan B. Djordjevic
:
On the α-q-Mutual Information and the α-q-Capacities. Entropy 23(6): 702 (2021)
2010 – 2019
- 2013
- [j4]Velimir M. Ilic, Miomir S. Stankovic, Edin H. Mulalic:
Comments on "Generalization of Shannon-Khinchin Axioms to Nonextensive Systems and the Uniqueness Theorem for the Nonextensive Entropy". IEEE Trans. Inf. Theory 59(10): 6950-6952 (2013) - [i8]Velimir M. Ilic, Miomir S. Stankovic:
A unified characterization of generalized information and certainty measures. CoRR abs/1310.4896 (2013) - [i7]Velimir M. Ilic, Miomir S. Stankovic:
An axiomatic characterization of generalized entropies under analyticity condition. CoRR abs/1311.0324 (2013) - 2012
- [j3]Velimir M. Ilic, Miomir S. Stankovic, Branimir Todorovic:
Computation of cross-moments using message passing over factor graphs. Adv. Math. Commun. 6(3): 363-384 (2012) - [j2]Velimir M. Ilic, Dejan I. Mancev, Branimir Todorovic, Miomir S. Stankovic:
Gradient computation in linear-chain conditional random fields using the entropy message passing algorithm. Pattern Recognit. Lett. 33(13): 1776-1784 (2012) - [i6]Milos B. Djuric, Velimir M. Ilic, Miomir S. Stankovic:
The computation of first order moments on junction trees. CoRR abs/1201.3408 (2012) - [i5]Velimir M. Ilic, Miomir S. Stankovic:
Comments on "Nonextensive Entropies derived from Form Invariance of Pseudoadditivity". CoRR abs/1210.7473 (2012) - 2011
- [j1]Velimir M. Ilic, Miomir S. Stankovic, Branimir Todorovic:
Entropy Message Passing. IEEE Trans. Inf. Theory 57(1): 375-380 (2011) - [i4]Velimir M. Ilic:
Entropy Semiring Forward-backward Algorithm for HMM Entropy Computation. CoRR abs/1108.0347 (2011) - [i3]Velimir M. Ilic, Miroslav D. Ciric, Miomir S. Stankovic:
Cross-moments computation for stochastic context-free grammars. CoRR abs/1108.0353 (2011) - 2010
- [i2]Velimir M. Ilic, Dejan I. Mancev, Branimir Todorovic, Miomir S. Stankovic:
Gradient Computation In Linear-Chain Conditional Random Fields Using The Entropy Message Passing Algorithm. CoRR abs/1011.1478 (2010)
2000 – 2009
- 2009
- [i1]Velimir M. Ilic, Miomir S. Stankovic, Branimir Todorovic:
Entropy Message Passing Algorithm. CoRR abs/0906.2895 (2009)
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 22:53 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint