default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTsvetan Asamov
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c6]Anna Aksenova, Tsvetan Asamov, Petar Ivanov, Svetla Boytcheva:
Improving Biomedical Question Answering with Sentence-based Ranking at BioASQ-11b. CLEF (Working Notes) 2023: 27-36- [c5]Petar Ivanov, Anna Aksenova, Tsvetan Asamov, Svetla Boytcheva:
Leveraging Biomedical Ontologies for Clinical Procedures Recognition in Spanish at BioASQ MedProcNER. CLEF (Working Notes) 2023: 122-131 - [c4]Tsvetan Asamov, Petar Ivanov, Anna Aksenova, Dimitar Taskov, Svetla Boytcheva:
Maximum Likelihood Estimation with Deep Learning for Multiple Sclerosis Progression Prediction. CLEF (Working Notes) 2023: 1165-1185 - [c3]Anton Hristov, Petar Ivanov, Anna Aksenova, Tsvetan Asamov, Pavlin Gyurov, Todor Primov
, Svetla Boytcheva:
Clinical Text Classification to SNOMED CT Codes Using Transformers Trained on Linked Open Medical Ontologies. RANLP 2023: 519-526 - 2022
- [i3]Tsvetan Asamov, Emre Yamangil, Endre Boros, Paul B. Kantor, Fred S. Roberts:
Optimal Layered Defense For Site Protection. CoRR abs/2204.08961 (2022)
2010 – 2019
- 2018
- [j4]Tsvetan Asamov, Warren B. Powell:
Regularized Decomposition of High-Dimensional Multistage Stochastic Programs with Markov Uncertainty. SIAM J. Optim. 28(1): 575-595 (2018) - [j3]Bolong Cheng, Tsvetan Asamov, Warren B. Powell:
Low-Rank Value Function Approximation for Co-Optimization of Battery Storage. IEEE Trans. Smart Grid 9(6): 6590-6598 (2018) - 2017
- [c2]Yingfei Wang, Hua Ouyang, Chu Wang, Jianhui Chen, Tsvetan Asamov, Yi Chang:
Efficient Ordered Combinatorial Semi-Bandits for Whole-Page Recommendation. AAAI 2017: 2746-2753 - 2015
- [j2]Tsvetan Asamov, Andrzej Ruszczynski:
Time-consistent approximations of risk-averse multistage stochastic optimization problems. Math. Program. 153(2): 459-493 (2015) - [i2]Tsvetan Asamov, Adi Ben-Israel:
An ℓ1-Method for Clustering High-Dimensional Data. CoRR abs/1504.01294 (2015) - [i1]Nuh Aydin, Tsvetan Asamov:
A Database of Z4 Codes. CoRR abs/1505.03406 (2015)
2000 – 2009
- 2007
- [j1]Tsvetan Asamov, Nuh Aydin:
A search algorithm for linear codes: progressive dimension growth. Des. Codes Cryptogr. 45(2): 213-217 (2007) - [c1]Nuh Aydin, Tsvetan Asamov, T. Aaron Gulliver:
Some Open Problems on Quasi-Twisted and Related Code Constructions and Good Quaternary Codes. ISIT 2007: 856-860
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-20 23:03 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:
