default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMark A. Novotny
Person information
- affiliation: Mississippi State University, MS, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j6]Vivek Dixit
, Raja Selvarajan, Tamer Aldwairi, Yaroslav Koshka, Mark A. Novotny, Travis S. Humble, Muhammad Ashraful Alam, Sabre Kais:
Training a Quantum Annealing Based Restricted Boltzmann Machine on Cybersecurity Data. IEEE Trans. Emerg. Top. Comput. Intell. 6(3): 417-428 (2022)- [c4]Bhavika Bhalgamiya, Dilina Perera, Mark A. Novotny:
Quantum Annealing Error Mitigation Using Mirror Symmetries on Different Generations of Quantum Annealers. QCE 2022: 844-846 - 2021
- [j5]Yaroslav Koshka, Mark A. Novotny:
Comparison of Use of a 2000 Qubit D-Wave Quantum Annealer and MCMC for Sampling, Image Reconstruction, and Classification. IEEE Trans. Emerg. Top. Comput. Intell. 5(1): 119-129 (2021) - 2020
- [j4]Yaroslav Koshka, Mark A. Novotny:
Comparison of D-Wave Quantum Annealing and Classical Simulated Annealing for Local Minima Determination. IEEE J. Sel. Areas Inf. Theory 1(2): 515-525 (2020) - [j3]Yaroslav Koshka, Mark A. Novotny:
Toward sampling from undirected probabilistic graphical models using a D-Wave quantum annealer. Quantum Inf. Process. 19(9): 353 (2020)
2010 – 2019
- 2019
- [i12]Yaroslav Koshka, Mark A. Novotny:
Towards Sampling from Nondirected Probabilistic Graphical models using a D-Wave Quantum Annealer. CoRR abs/1905.00159 (2019) - [i11]Yaroslav Koshka, Mark A. Novotny:
Comparison of D-Wave Quantum Annealing and Classical Simulated Annealing for Local Minima Determination. CoRR abs/1911.03338 (2019) - 2018
- [j2]Tamer Aldwairi, Dilina Perera, Mark A. Novotny:
An evaluation of the performance of Restricted Boltzmann Machines as a model for anomaly network intrusion detection. Comput. Networks 144: 111-119 (2018) - [c3]Yaroslav Koshka, Mark A. Novotny:
2000 Qubit D-Wave Quantum Computer Replacing MCMC for RBM Image Reconstruction and Classification. IJCNN 2018: 1-8 - 2017
- [j1]Yaroslav Koshka, Dilina Perera, Spencer Hall, Mark A. Novotny:
Determination of the Lowest-Energy States for the Model Distribution of Trained Restricted Boltzmann Machines Using a 1000 Qubit D-Wave 2X Quantum Computer. Neural Comput. 29(7): 1815-1837 (2017) - 2016
- [c2]Yaroslav Koshka, Dilina Perera, Spencer Hall, Mark A. Novotny:
Empirical investigation of the low temperature energy function of the Restricted Boltzmann Machine using a 1000 qubit D-Wave 2X. IJCNN 2016: 1948-1954
2000 – 2009
- 2006
- [p1]Zoltán Toroczkai, György Korniss, Mark A. Novotny, Hasan Guclu:
Scalability, Random Surfaces, and Synchronized Computing Networks. Computational Complexity and Statistical Physics 2006: 249-270 - 2004
- [i10]Lev N. Shchur, Mark A. Novotny:
On the Evolution of Time Horizons in Parallel and Grid Simulations. CoRR cond-mat/0401229 (2004) - [i9]A. K. Kolakowska, Mark A. Novotny, P. S. Verma:
Dynamics of desynchronization in a conservative parallel-update protocol. CoRR cond-mat/0403341 (2004) - [i8]A. K. Kolakowska, Mark A. Novotny:
Desynchronization and Speedup in an Asynchronous Conservative Parallel Update Protocol. CoRR cs.DC/0409032 (2004) - 2003
- [i7]György Korniss, Mark A. Novotny, Hasan Guclu, Zoltán Toroczkai, Per Arne Rikvold:
Suppressing Roughness of Virtual Times in Parallel Discrete-Event Simulations. CoRR cond-mat/0302050 (2003) - [i6]A. K. Kolakowska, Mark A. Novotny, Per Arne Rikvold:
Update statistics in conservative parallel discrete event simulations of asynchronous systems. CoRR cond-mat/0306222 (2003) - 2002
- [c1]György Korniss, Mark A. Novotny, A. K. Kolakowska, Hasan Guclu:
Statistical properties of the simulated time horizon in conservative parallel discrete-event simulations. SAC 2002: 132-137 - [i5]A. K. Kolakowska, Mark A. Novotny, György Korniss:
Algorithmic scalability in globally constrained conservative parallel discrete event simulations of asynchronous systems. CoRR cs.DC/0211013 (2002) - 2001
- [i4]György Korniss, Mark A. Novotny, Per Arne Rikvold, Hasan Guclu, Zoltán Toroczkai:
Going through Rough Times: from Non-Equilibrium Surface Growth to Algorithmic Scalability. CoRR cond-mat/0112103 (2001) - 2000
- [i3]György Korniss, Mark A. Novotny, Zoltán Toroczkai, Per Arne Rikvold:
Non-equilibrium Surface Growth and Scalability of Parallel Algorithms for Large Asynchronous Systems. CoRR cond-mat/0002469 (2000)
1990 – 1999
- 1999
- [i2]György Korniss, Zoltán Toroczkai, Mark A. Novotny, Per Arne Rikvold:
From Massively Parallel Algorithms and Fluctuating Time Horizons to Non-equilibrium Surface Growth. CoRR cond-mat/9909114 (1999) - 1998
- [i1]György Korniss, Mark A. Novotny, Per Arne Rikvold:
Parallelization of a Dynamic Monte Carlo Algorithm: a Partially Rejection-Free Conservative Approach. CoRR cond-mat/9812344 (1998)
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-04-24 22:50 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:
