default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKristian Sabo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j23]Kristian Sabo
, Rudolf Scitovski, Sime Ungar, Zoran Tomljanovic:
A method for searching for a globally optimal k-partition of higher-dimensional datasets. J. Glob. Optim. 89(3): 633-653 (2024)- 2023
- [j22]Rudolf Scitovski, Kristian Sabo, Patrick Nikic, Snjezana Majstorovic:
A new efficient method for solving the multiple ellipse detection problem. Expert Syst. Appl. 222: 119853 (2023) - [j21]Rudolf Scitovski, Kristian Sabo, Danijel Grahovac, Sime Ungar:
Minimal distance index - A new clustering performance metrics. Inf. Sci. 640: 119046 (2023) - [j20]Kristian Sabo, Rudolf Scitovski, Sime Ungar:
Multiple spheres detection problem - Center based clustering approach. Pattern Recognit. Lett. 176: 34-41 (2023) - 2021
- [j19]Rudolf Scitovski, Kristian Sabo:
A combination of k-means and DBSCAN algorithm for solving the multiple generalized circle detection problem. Adv. Data Anal. Classif. 15(1): 83-98 (2021) - [j18]Dragan Jukic, Kristian Sabo:
An existence criterion for the nonlinear ℓ p-norm fitting problem. Central Eur. J. Oper. Res. 29(3): 957-966 (2021) - [j17]Rudolf Scitovski, Snjezana Majstorovic, Kristian Sabo:
A combination of RANSAC and DBSCAN methods for solving the multiple geometrical object detection problem. J. Glob. Optim. 79(3): 669-686 (2021) - 2020
- [j16]Kristian Sabo, Danijel Grahovac, Rudolf Scitovski:
Incremental method for multiple line detection problem - iterative reweighted approach. Math. Comput. Simul. 178: 588-602 (2020) - [j15]Rudolf Scitovski, Kristian Sabo:
DBSCAN-like clustering method for various data densities. Pattern Anal. Appl. 23(2): 541-554 (2020) - 2019
- [j14]Rudolf Scitovski, Kristian Sabo:
Application of the DIRECT algorithm to searching for an optimal k-partition of the set A ⊂ Rn and its application to the multiple circle detection problem. J. Glob. Optim. 74(1): 63-77 (2019) - 2018
- [j13]Snjezana Majstorovic, Kristian Sabo, Johannes Jung, Matija Klaric:
Spectral methods for growth curve clustering. Central Eur. J. Oper. Res. 26(3): 715-737 (2018) - [j12]Safet Hamedovic, Mirta Bensic, Kristian Sabo, Petar Taler:
Estimating the size of an object captured with error. Central Eur. J. Oper. Res. 26(3): 771-781 (2018) - 2017
- [j11]Mirta Bensic, Petar Taler, Safet Hamedovic, Emmanuel Karlo Nyarko, Kristian Sabo:
LeArEst: Length and Area Estimation from Data Measured with Additive Error. R J. 9(2): 461 (2017) - 2015
- [j10]Kristian Sabo, Rudolf Scitovski:
An approach to cluster separability in a partition. Inf. Sci. 305: 208-218 (2015) - 2014
- [j9]Kristian Sabo:
Center-based l1-clustering method. Int. J. Appl. Math. Comput. Sci. 24(1): 151-163 (2014) - [j8]Rudolf Scitovski, Kristian Sabo:
Analysis of the k-means algorithm in the case of data points occurring on the border of two or more clusters. Knowl. Based Syst. 57: 1-7 (2014) - 2013
- [j7]Ratko Grbic, Klaudija Scitovski, Kristian Sabo, Rudolf Scitovski:
Approximating surfaces by the moving least absolute deviations method. Appl. Math. Comput. 219(9): 4387-4399 (2013) - [j6]Kristian Sabo, Rudolf Scitovski, Ivan Vazler:
One-dimensional center-based l 1-clustering method. Optim. Lett. 7(1): 5-22 (2013) - 2012
- [j5]Dragutin Vincek, Gordana Kralik, Goran Kusec, Kristian Sabo, Rudolf Scitovski:
Application of growth functions in the prediction of live weight of domestic animals. Central Eur. J. Oper. Res. 20(4): 719-733 (2012) - 2011
- [j4]Kristian Sabo, Rudolf Scitovski, Ivan Vazler:
Searching for a Best Least Absolute Deviations Solution of an Overdetermined System of Linear Equations Motivated by Searching for a Best Least Absolute Deviations Hyperplane on the Basis of Given Data. J. Optim. Theory Appl. 149(2): 293-314 (2011) - 2009
- [j3]Robert Cupec, Ratko Grbic, Kristian Sabo, Rudolf Scitovski:
Three points method for searching the best least absolute deviations plane. Appl. Math. Comput. 215(3): 983-994 (2009) - 2007
- [j2]Mirta Bensic, Kristian Sabo:
Estimating the width of a uniform distribution when data are measured with additive normal errors with known variance. Comput. Stat. Data Anal. 51(9): 4731-4741 (2007) - 2006
- [j1]Rudolf Scitovski, Gordana Kralik, Kristian Sabo, Tatjana Jelen:
A mathematical model of controlling the growth of tissue in pigs. Appl. Math. Comput. 181(2): 1126-1138 (2006)
Conference and Workshop Papers
- 2020
- [c3]Kristian Sabo, Rudolf Scitovski:
Multiple Ellipse Detection by using RANSAC and DBSCAN Method. ICPRAM 2020: 129-135 - 2019
- [c2]Una Radojicic, Rudolf Scitovski, Kristian Sabo:
A Fast and Efficient Method for Solving the Multiple Closed Curve Detection Problem. ICPRAM 2019: 269-276 - 2009
- [c1]Robert Cupec, Ratko Grbic, Emmanuel Karlo Nyarko, Kristian Sabo, Rudolf Scitovski:
Detection of Planar Surfaces Based on RANSAC and LAD Plane Fitting. ECMR 2009: 37-42
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: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 and maintained by:
the dblp computer science bibliography is funded and supported by:
