default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPawel M. Morkisz
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j11]Andrzej Kaluza
, Pawel M. Morkisz, Bartlomiej Mulewicz, Pawel Przybylowicz, Martyna Wiacek:
Deep learning-based estimation of time-dependent parameters in Markov models with application to nonlinear regression and SDEs. Appl. Math. Comput. 480: 128906 (2024)- [j10]Lukasz Struski, Pawel M. Morkisz, Przemyslaw Spurek, Samuel Rodriguez Bernabeu, Tomasz Trzcinski:
Efficient GPU implementation of randomized SVD and its applications. Expert Syst. Appl. 248: 123462 (2024) - [j9]Lukasz Maziarka, Dawid Majchrowski, Tomasz Danel, Piotr Gainski, Jacek Tabor, Igor T. Podolak, Pawel M. Morkisz, Stanislaw Jastrzebski:
Relative molecule self-attention transformer. J. Cheminformatics 16(1): 3 (2024) - 2023
- [i9]Marcin Baranek, Andrzej Kaluza, Pawel M. Morkisz, Pawel Przybylowicz, Michal Sobieraj:
On the randomized Euler algorithm under inexact information. CoRR abs/2307.04718 (2023) - [i8]Andrzej Kaluza, Pawel M. Morkisz, Bartlomiej Mulewicz, Pawel Przybylowicz, Martyna Wiacek:
Deep learning-based estimation of time-dependent parameters in Markov models with application to nonlinear regression and SDEs. CoRR abs/2312.08493 (2023) - 2022
- [j8]Natalia Czyzewska, Jan Kusiak, Pawel M. Morkisz, Piotr Oprocha, Maciej Pietrzyk, Pawel Przybylowicz, Lukasz Rauch, Danuta Szeliga:
On Mathematical Aspects of Evolution of Dislocation Density in Metallic Materials. IEEE Access 10: 86793-86812 (2022) - [j7]Natalia Czyzewska, Pawel M. Morkisz, Pawel Przybylowicz:
Approximation of solutions of DDEs under nonstandard assumptions via Euler scheme. Numer. Algorithms 91(4): 1829-1854 (2022) - [i7]Natalia Czyzewska, Pawel M. Morkisz, Pawel Przybylowicz:
Euler scheme for approximation of solution of nonlinear ODEs under inexact information. CoRR abs/2209.07482 (2022) - 2021
- [j6]Tomasz Bochacik, Maciej Gocwin, Pawel M. Morkisz, Pawel Przybylowicz:
Randomized Runge-Kutta method - Stability and convergence under inexact information. J. Complex. 65: 101554 (2021) - [j5]Pawel M. Morkisz, Pawel Przybylowicz:
Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information. J. Comput. Appl. Math. 383: 113112 (2021) - [i6]Natalia Czyzewska, Pawel M. Morkisz, Pawel Przybylowicz:
Approximation of solutions of DDEs under nonstandard assumptions via Euler scheme. CoRR abs/2106.03731 (2021) - [i5]Lukasz Struski, Pawel M. Morkisz, Przemyslaw Spurek, Samuel Rodriguez Bernabeu, Tomasz Trzcinski:
Efficient GPU implementation of randomized SVD and its applications. CoRR abs/2110.03423 (2021) - [i4]Lukasz Maziarka, Dawid Majchrowski, Tomasz Danel, Piotr Gainski, Jacek Tabor, Igor T. Podolak, Pawel M. Morkisz, Stanislaw Jastrzebski:
Relative Molecule Self-Attention Transformer. CoRR abs/2110.05841 (2021) - 2020
- [j4]Pawel M. Morkisz, Leszek Plaskota:
Complexity of approximating Hölder classes from information with varying Gaussian noise. J. Complex. 60: 101497 (2020) - [i3]Tomasz Bochacik, Maciej Gocwin, Pawel M. Morkisz, Pawel Przybylowicz:
Randomized Runge-Kutta method - stability and convergence under inexact information. CoRR abs/2006.12131 (2020) - [i2]Natalia Czyzewska, Jan Kusiak, Pawel M. Morkisz, Piotr Oprocha, Maciej Pietrzyk, Pawel Przybylowicz, Lukasz Rauch, Danuta Szeliga:
On mathematical aspects of evolution of dislocation density in metallic materials. CoRR abs/2011.08504 (2020)
2010 – 2019
- 2019
- [j3]Andrzej Kaluza, Pawel M. Morkisz, Pawel Przybylowicz:
Optimal approximation of stochastic integrals in analytic noise model. Appl. Math. Comput. 356: 74-91 (2019) - [c3]Xinyuan Huang, Geoffrey C. Fox, Sergey Serebryakov, Ankur Mohan, Pawel M. Morkisz, Debojyoti Dutta:
Benchmarking Deep Learning for Time Series: Challenges and Directions. IEEE BigData 2019: 5679-5682 - [i1]Pawel M. Morkisz, Pawel Przybylowicz:
Randomized derivative-free Milstein algorithm for efficient approximation of solutions of SDEs under noisy information. CoRR abs/1912.06865 (2019) - 2017
- [j2]Pawel M. Morkisz, Pawel Przybylowicz:
Optimal pointwise approximation of SDE's from inexact information. J. Comput. Appl. Math. 324: 85-100 (2017) - 2016
- [j1]Pawel M. Morkisz, Leszek Plaskota:
Approximation of piecewise Hölder functions from inexact information. J. Complex. 32(1): 122-136 (2016) - [c2]Jan Kusiak, Pawel M. Morkisz, Piotr Oprocha, Wojciech Pietrucha, Lukasz Sztangret:
On Aggregation of Stages in Multi-criteria Optimization of Chain Structured Processes. ICAISC (1) 2016: 411-419 - [c1]Mateusz Marzec, Pawel M. Morkisz, Jakub Wojdyla, Tadeusz Uhl:
Intelligent Predictive Maintenance System. IntelliSys (1) 2016: 794-804
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 21:20 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:
