default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlex Ter-Sarkisov
Person information
- affiliation: City University of London, Department of Computer Science, UK
- affiliation: Dublin Institute of Technology, Ireland
- affiliation: Le Mans University, France
- affiliation: University of Waterloo, ON, Canada
- affiliation (PhD 2012): Massey University, New Zealand
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2022
[j5]Aram Ter-Sarkisov
:
COVID-CT-Mask-Net: prediction of COVID-19 from CT scans using regional features. Appl. Intell. 52(9): 9664-9675 (2022)- [j4]Aram Ter-Sarkisov:
One Shot Model For The Prediction of COVID-19 And Lesions Segmentation In Chest CT Scans Through The Affinity Among Lesion Mask Features. Appl. Soft Comput. 116: 108261 (2022) - [j3]Aram Ter-Sarkisov:
One Shot Model for COVID-19 Classification and Lesions Segmentation in Chest CT Scans Using Long Short-Term Memory Network With Attention Mechanism. IEEE Intell. Syst. 37(3): 54-64 (2022) - 2021
- [j2]Ananda Ananda, Kwun Ho Ngan, Cefa Karabag, Aram Ter-Sarkisov, Eduardo Alonso, Constantino Carlos Reyes-Aldasoro:
Classification and Visualisation of Normal and Abnormal Radiographs; A Comparison between Eleven Convolutional Neural Network Architectures. Sensors 21(16): 5381 (2021) - [c11]Aram Ter-Sarkisov, Eduardo Alonso:
Logo Generation Using Regional Features: A Faster R-CNN Approach to Generative Adversarial Networks. ArtsIT 2021: 442-456 - [c10]Abdul Basit Hafeez, Eduardo Alonso, Aram Ter-Sarkisov:
Towards Sequential Multivariate Fault Prediction for Vehicular Predictive Maintenance. ICMLA 2021: 1016-1021 - [i9]Aram Ter-Sarkisov, Eduardo Alonso:
Logo Generation Using Regional Features: A Faster R-CNN Approach to Generative Adversarial Networks. CoRR abs/2109.12628 (2021) - 2020
- [c9]Aram Ter-Sarkisov:
Network of Steel: Neural Font Style Transfer from Heavy Metal to Corporate Logos. ICPRAM 2020: 621-629 - [i8]Aram Ter-Sarkisov:
Network of Steel: Neural Font Style Transfer from Heavy Metal to Corporate Logos. CoRR abs/2001.03659 (2020)
2010 – 2019
- 2018
- [c8]Aram Ter-Sarkisov, John D. Kelleher, Bernadette Earley, Michael Keane, Robert J. Ross:
Beef Cattle Instance Segmentation Using Fully Convolutional Neural Network. BMVC 2018: 272 - [i7]Aram Ter-Sarkisov, Robert J. Ross, John D. Kelleher, Bernadette Earley, Michael Keane:
Beef Cattle Instance Segmentation Using Fully Convolutional Neural Network. CoRR abs/1807.01972 (2018) - 2017
- [j1]Aram Ter-Sarkisov, Stephen Marsland:
K-Bit-Swap: a new operator for real-coded evolutionary algorithms. Soft Comput. 21(20): 6133-6142 (2017) - [c7]Aram Ter-Sarkisov, Robert J. Ross, John D. Kelleher:
Bootstrapping Labelled Dataset Construction for Cow Tracking and Behavior Analysis. CRV 2017: 277-284 - [i6]Aram Ter-Sarkisov, Robert J. Ross, John D. Kelleher:
Bootstrapping Labelled Dataset Construction for Cow Tracking and Behavior Analysis. CoRR abs/1703.10571 (2017) - 2016
- [i5]Aram Ter-Sarkisov, Stephen R. Marsland:
K-Bit-Swap: A New Operator For Real-Coded Evolutionary Algorithms. CoRR abs/1604.06607 (2016) - 2015
- [c6]Alex Ter-Sarkisov, Holger Schwenk, Fethi Bougares, Loïc Barrault:
Incremental Adaptation Strategies for Neural Network Language Models. CVSC 2015: 48-56 - 2014
- [i4]Aram Ter-Sarkisov, Holger Schwenk, Fethi Bougares, Loïc Barrault:
Incremental Adaptation Strategies for Neural Network Language Models. CoRR abs/1412.6650 (2014) - 2012
- [c5]Aram Ter-Sarkisov:
Elitism Levels Traverse Mechanism for the derivation of upper bounds on unimodal functions. IEEE Congress on Evolutionary Computation 2012: 1-8 - [i3]Aram Ter-Sarkisov:
Elitism Levels Traverse Mechanism For The Derivation of Upper Bounds on Unimodal Functions. CoRR abs/1202.5284 (2012) - 2011
- [c4]Aram Ter-Sarkisov, Stephen R. Marsland:
Convergence Properties of (μ + λ) Evolutionary Algorithms. AAAI 2011: 1816-1817 - [c3]Aram Ter-Sarkisov, Stephen R. Marsland:
Convergence of a Recombination-Based Elitist Evolutionary Algorithm on the Royal Roads Test Function. Australasian Conference on Artificial Intelligence 2011: 361-371 - [c2]Aram Ter-Sarkisov, Stephen Marsland:
Convergence Properties of Two (μ+λ) Evolutionary Algorithms on OneMax and Royal Roads Test Functions. IJCCI (ECTA-FCTA) 2011: 196-202 - [i2]Aram Ter-Sarkisov, Stephen R. Marsland:
Convergence Properties of Two (μ + λ) Evolutionary Algorithms On OneMax and Royal Roads Test Functions. CoRR abs/1108.4080 (2011) - [i1]Aram Ter-Sarkisov, Stephen R. Marsland:
Convergence of a Recombination-Based Elitist Evolutionary Algorithm on the Royal Roads Test Function. CoRR abs/1108.4083 (2011) - 2010
- [c1]Aram Ter-Sarkisov, Stephen R. Marsland, Barbara R. Holland:
The K-bit-swap: a new genetic algorithm operator. GECCO 2010: 815-816
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-10-23 02:05 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
