Zobrazeno 1 - 10
of 14
pro vyhledávání: '"Can Ozbey"'
Publikováno v:
2022 3rd International Informatics and Software Engineering Conference (IISEC).
Autor:
Can Ozbey
Publikováno v:
2022 International Conference on INnovations in Intelligent SysTems and Applications (INISTA).
Autor:
Can Ozbey, Onur Sahil Cerit
Publikováno v:
2022 30th Signal Processing and Communications Applications Conference (SIU).
Autor:
Aysegul Karcili, Can Ozbey
Publikováno v:
2021 Innovations in Intelligent Systems and Applications Conference (ASYU).
In this paper, we present an unsupervised statistical method for detecting stems given a large set of words. The idea is to find the segmentation point within a word that yields the most likely prefix-suffix pair using dynamic dual dictionaries. We i
Publikováno v:
2021 Innovations in Intelligent Systems and Applications Conference (ASYU).
Domain adaptation is a well-studied field of research that aims at adapting machine learning models trained on specific source domains into different target domains. However, the case of multi-classifier systems is relatively less studied particularl
Publikováno v:
2021 6th International Conference on Computer Science and Engineering (UBMK).
Nowadays, machine learning and deep learning models are used in many fields and giving promising results. Large amounts of labeled data are needed to increase the performance of these models, which become more complex and growing as technology advanc
Autor:
Can Ozbey, Ozge Dincsoy
Publikováno v:
SIU
In this paper, an efficient annotation scheme based on pairwise comparison is proposed in order to evaluate document ranking algorithms in information retrieval systems. With the assumption that document relevance to query expressions abides the pri
Autor:
Can Ozbey, Ozge Dincsoy
Publikováno v:
2020 5th International Conference on Computer Science and Engineering (UBMK).
In this paper, we present a finite-state approach to efficiently decode a sequence of Rice codes. The proposed method is capable of decoding a byte stream for any Golomb parameter for unboundedly large alphabets with constant space complexity. Perfor
Autor:
Can Ozbey
Publikováno v:
2020 5th International Conference on Computer Science and Engineering (UBMK).
In this paper, we present a method that reduces the decoding complexity of an entropy encoding technique, namely, combinatorial coding, in order to increase compression efficiency without suffering from intolerable decoding latency. Performance of th
Publikováno v:
SAC
Estimating the software development effort associated with a customer request, immediately after the request has been made, is quite challenging for project managers. Studies on software effort estimation often utilize expert knowledge to build stati