default search action
Sergey D. Dvoenko
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j5]Dang Ngoc Hoang Thanh
, V. B. Surya Prasath
An adaptive image inpainting method based on euler's elastica with adaptive parameters estimation and the discrete gradient method. Signal Process. 178: 107797 (2021) - 2020
- [j4]Dang N. H. Thanh
An adaptive method for image restoration based on high-order total variation and inverse gradient. Signal Image Video Process. 14(6): 1189-1197 (2020) - [c13]Sergey D. Dvoenko, Denis O. Pshenichny:
Developing the Kemeny's Weighted Median for the Rank Aggregation Problem. ICFNDS 2020: 45:1-45:4 - [c12]Sergey D. Dvoenko
On New Kemeny's Medians. ICPR Workshops (5) 2020: 97-102 - [c11]V. B. Surya Prasath
Multiregion Multiscale Image Segmentation with Anisotropic Diffusion. ICPR Workshops (5) 2020: 129-140
2010 – 2019
- 2019
- [j3]Sergey D. Dvoenko, Jan W. Owsinski:
The Permutable k-means for the Bi-Partial Criterion. Informatica (Slovenia) 43(2) (2019) - 2016
- [j2]Dang N. H. Thanh, Sergey D. Dvoenko, Dinh Viet Sang:
A Mixed Noise Removal Method Based on Total Variation. Informatica (Slovenia) 40(2) (2016) - [c10]Sergey D. Dvoenko, Denis O. Pshenichny:
On a Metric Kemeny's Median. IDP 2016: 44-57 - [c9]Sergey D. Dvoenko, Denis O. Pshenichny:
A recovering of violated metric in machine learning. SoICT 2016: 15-21 - [c8]Dang N. H. Thanh
Colour image denoising based on a combined model. SoICT 2016: 308-315 - 2015
- [c7]Dang N. H. Thanh, Sergey D. Dvoenko:
A Variational Method to Remove the Combination of Poisson and Gaussian Noises. IMTA 2015: 38-45 - [c6]Dang N. H. Thanh
A Denoising Method Based on Total Variation. SoICT 2015: 223-230
2000 – 2009
- 2009
- [j1]Sergey D. Dvoenko:
Clustering and Separating of a Set of Members in Terms of Mutual Distances and Similarities. Trans. Mach. Learn. Data Min. 2(2): 80-99 (2009) - [c5]Sergey D. Dvoenko:
Clustering and Separating of a Set of Members in Terms of Mutual Distances and Proximities. MLDM Posters 2009: 161-175 - 2004
- [c4]Vadim Mottl, Sergey D. Dvoenko, Andrey Kopylov
Pattern Recognition in Interrelated Data: The Problem, Fundamental Assumptions, Recognition Algorithms. ICPR (1) 2004: 188-191 - 2002
- [c3]Vadim Mottl, Oleg Seredin, Sergey D. Dvoenko, Casimir A. Kulikowski, Ilya B. Muchnik:
Featureless Pattern Recognition in an Imaginary Hilbert Space. ICPR (2) 2002: 88-91 - 2001
- [c2]Vadim Mottl, Sergey D. Dvoenko, Oleg Seredin
Featureless Pattern Recognition in an Imaginary Hilbert Space and Its Application to Protein Fold Classification. MLDM 2001: 322-336 - 2000
- [c1]Vadim Mottl, Sergey D. Dvoenko, Vladimir Levyant, Ilya B. Muchnik:
Pattern Recognition in Spatial Data: A New Method of Seismic Explorations for Oil and Gas in Crystalline Basement Rocks. ICPR 2000: 2315-2318
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: