default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLukás Pospísil
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j10]Davide Bassetti
, Lukás Pospísil, Illia Horenko:
On Entropic Learning from Noisy Time Series in the Small Data Regime. Entropy 26(7): 553 (2024)- 2023
- [i3]Illia Horenko, Lukás Pospísil:
Linearly-scalable learning of smooth low-dimensional patterns with permutation-aided entropic dimension reduction. CoRR abs/2306.10287 (2023) - [i2]Edoardo Vecchi, Davide Bassetti, Fabio Graziato, Lukás Pospísil, Illia Horenko:
Gauge-optimal approximate learning for small data classification problems. CoRR abs/2310.19066 (2023) - 2022
- [j9]Illia Horenko, Lukás Pospísil, Edoardo Vecchi, Steffen Albrecht, Alexander Gerber, Beate Rehbock, Albrecht Stroh, Susanne Gerber:
Low-Cost Probabilistic 3D Denoising with Applications for Ultra-Low-Radiation Computed Tomography. J. Imaging 8(6): 156 (2022) - [j8]Edoardo Vecchi, Lukás Pospísil, Steffen Albrecht, Terence J. O'Kane, Illia Horenko:
eSPA+: Scalable Entropy-Optimal Machine Learning Classification for Small Data Problems. Neural Comput. 34(5): 1220-1255 (2022) - 2021
- [j7]Susanne Gerber, Lukás Pospísil, Stanislav Sys, Charlotte Hewel, Ali Torkamani, Illia Horenko:
Co-Inference of Data Mislabelings Reveals Improved Models in Genomics and Breast Cancer Diagnostics. Frontiers Artif. Intell. 4 (2021) - 2020
- [j6]Jakub Kruzík, David Horák, Martin Cermák, Lukás Pospísil, Marek Pecha:
Active set expansion strategies in MPRGP algorithm. Adv. Eng. Softw. 149: 102895 (2020) - [i1]Jakub Kruzik, David Horák, Martin Cermák, Lukás Pospísil, Marek Pecha:
Active set expansion strategies in MPRGP algorithm. CoRR abs/2002.06077 (2020)
2010 – 2019
- 2018
- [j5]Zdenek Dostál, Lukás Pospísil:
Conjugate gradients for symmetric positive semidefinite least-squares problems. Int. J. Comput. Math. 95(11): 2229-2239 (2018) - [j4]Lukás Pospísil, Zdenek Dostál:
The projected Barzilai-Borwein method with fall-back for strictly convex QCQP problems with separable constraints. Math. Comput. Simul. 145: 79-89 (2018) - 2016
- [j3]Zdenek Dostál, Lukás Pospísil:
Optimal iterative QP and QPQC algorithms. Ann. Oper. Res. 243(1-2): 5-18 (2016) - 2015
- [j2]Zdenek Dostál, Lukás Pospísil:
Minimizing quadratic functions with semidefinite Hessian subject to bound constraints. Comput. Math. Appl. 70(8): 2014-2028 (2015) - [c2]Vaclav Hapla, David Horák, Lukás Pospísil, Martin Cermák, Alena Vasatová, Radim Sojka:
Solving Contact Mechanics Problems with PERMON. HPCSE 2015: 101-115 - [c1]Lukás Pospísil, Martin Hasal, Jana Nowaková, Jan Platos:
Computation of Kamada-Kawai Algorithm Using Barzilai-Borwein Method. INCoS 2015: 327-333 - 2014
- [j1]Jirí Bouchala, Zdenek Dostál, Tomás Kozubek, Lukás Pospísil, Petr Vodstrcil:
On the solution of convex QPQC problems with elliptic and other separable constraints with strong curvature. Appl. Math. Comput. 247: 848-864 (2014)
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 2024-10-07 22:07 CEST 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:
