default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVladislav B. Tadic
Person information
Other persons with a similar name
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2015
[j5]Richard Porter, Vladislav B. Tadic, Alin M. Achim
:
Sparse Bayesian Learning for non-Gaussian sources. Digit. Signal Process. 45: 2-12 (2015)- [c12]Richard Porter, Vladislav B. Tadic, Alin Achim:
Better than ℓ0 recovery via blind identification. GlobalSIP 2015: 1280-1284 - [c11]Richard Porter, Vladislav B. Tadic, Alin M. Achim:
Reconstruction of compressively sensed ultrasound RF echoes by exploiting non-Gaussianity and temporal structure. ICIP 2015: 6-10 - 2014
- [c10]Richard Porter, Vladislav B. Tadic, Alin M. Achim:
Blind separation of sources with finite rate of innovation. EUSIPCO 2014: 136-140 - 2010
- [j4]Vladislav B. Tadic:
Analyticity, Convergence, and Convergence Rate of Recursive Maximum-Likelihood Estimation in Hidden Markov Models. IEEE Trans. Inf. Theory 56(12): 6406-6432 (2010) - [c9]Vladislav B. Tadic:
Convergence and convergence rate of stochastic gradient search in the case of multiple and non-isolated extrema. CDC 2010: 5321-5326
2000 – 2009
- 2006
- [j3]Vladislav B. Tadic:
Asymptotic analysis of temporal-difference learning algorithms with constant step-sizes. Mach. Learn. 63(2): 107-133 (2006) - 2004
- [j2]Vladislav B. Tadic:
On the almost sure rate of convergence of linear stochastic approximation algorithms. IEEE Trans. Inf. Theory 50(2): 401-409 (2004) - [c8]Vladislav B. Tadic:
Almost sure convergence of two time-scale stochastic approximation algorithms. ACC 2004: 3802-3807 - [c7]Vladislav B. Tadic, Amaud Doucet:
A simulation based algorithm for optimal quantization in non-linear/non-Gaussian state-space models. ACC 2004: 5408-5413 - [c6]Vladislav B. Tadic:
Diffusion approximation for two time-scale stochastic approximation algorithms with constant step sizes. CDC 2004: 4187-4192 - [c5]Vladislav B. Tadic:
On the robustness of two time-scale stochastic approximation algorithms. CDC 2004: 5334-5339 - 2003
- [j1]Shane G. Henderson, Sean P. Meyn, Vladislav B. Tadic:
Performance Evaluation and Policy Selection in Multiclass Networks. Discret. Event Dyn. Syst. 13(1-2): 149-189 (2003) - [c4]Vladislav B. Tadic, Sean P. Meyn:
Asymptotic properties of two time-scale stochastic approximation algorithms with constant step sizes. ACC 2003: 4426-4431 - [c3]Vladislav B. Tadic, Sean P. Meyn, Roberto Tempo:
Randomized algorithms for semi-infinite programming problems. ECC 2003: 3011-3015 - 2002
- [c2]Vladislav B. Tadic, Vikram Krishnamurthy:
Mean-square asymptotic analysis of cross-coupled Kalman filter state-estimation algorithm for bilinear systems. ACC 2002: 881-886 - [c1]Vladislav B. Tadic:
On the mean-square rate of convergence of temporal-difference learning algorithms. ACC 2002: 1454-1459
Coauthor Index
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 2025-01-09 13:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
