Başlık için Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering listeleme
Toplam kayıt 188, listelenen: 133-152
-
An observation based muscle model for simulation of facial expressions
(Elsevier Science BV, 2018-05)This study presents a novel facial muscle model for coding of facial expressions. We derive this model from unintrusive observation of human subjects in the progress of the surprise expression. We use a generic and ... -
Odaklanan nöron
(IEEE, 2017-06-27)Geleneksel yapay sinir ağında topoloji eğitim sırasında değişebilecek esnekliğe sahip değildir. Ağda her bir nöron ve bağımsız bağlantı katsayıları çözüm işlevinin bir parçasıdır. Bu bildiride önerdiğimiz odaklanabilir ... -
Omnivariate rule induction using a novel pairwise statistical test
(IEEE Computer Soc, 2013-09)Rule learning algorithms, for example, RIPPER, induces univariate rules, that is, a propositional condition in a rule uses only one feature. In this paper, we propose an omnivariate induction of rules where under each ... -
On building the largest and cross-linguistic Turkish dependency corpus
(Institute of Electrical and Electronics Engineers Inc., 2020-10-15)In this paper, we aim to introduce the dependency annotation process of the largest and the only cross-linguistic Turkish dependency treebank which was translated from the original Penn Treebank corpus. Within the scope ... -
On the feature extraction in discrete space
(Elsevier Sci Ltd, 2014-05)In many pattern recognition applications, feature space expansion is a key step for improving the performance of the classifier. In this paper, we (i) expand the discrete feature space by generating all orderings of values ... -
On the maximum cardinality cut problem in proper interval graphs and related graph classes
(Elsevier B.V., 2022-01-04)Although it has been claimed in two different papers that the maximum cardinality cut problem is polynomial-time solvable for proper interval graphs, both of them turned out to be erroneous. In this work we consider the ... -
On the online coalition structure generation problem
(AI Access Foundationusc Information Sciences Inst, 2021)We consider the online version of the coalition structure generation problem, in which agents, corresponding to the vertices of a graph, appear in an online fashion and have to be partitioned into coalitions by an authority ... -
On the VC-dimension of univariate decision trees
(2012)In this paper, we give and prove lower bounds of the VC-dimension of the univariate decision tree hypothesis class. The VC-dimension of the univariate decision tree depends on the VC-dimension values of its subtrees and ... -
An open, extendible, and fast Turkish morphological analyzer
(Incoma Ltd, 2019-09)In this paper, we present a two-level morphological analyzer for Turkish which consists of five main components: finite state transducer, rule engine for suffixation, lexicon, trie data structure, and LRU cache. We use ... -
Palmprint verification using SIFT majority voting
(Springer-Verlag, 2012)In this paper we illustrate the implementation of a robust, real-time biometric system for identity verification based on palmprint images. The palmprint images are preprocessed to align the major axes of hand shapes and ... -
Parallel univariate decision trees
(Elsevier B.V., 2007-05-01)Univariate decision tree algorithms are widely used in data mining because (i) they are easy to learn (ii) when trained they can be expressed in rule based manner. In several applications mainly including data mining, the ... -
A priority based packet scheduler with deadline considerations
(IEEE Computer Soc, 2006)QoS issues have become a focal point of research on Next Generation Networks (NGNs). In order to supply the various QoS requirement for different kinds of applications, new scheduling policies need to be developed and ... -
Problems caused by semantic drift in WordNet synset construction
(Institute of Electrical and Electronics Engineers Inc., 2019-09)In this study, we summarize the semantic drift problem that occur in specific synsets of KeNet, a Turkish WordNet, which is caused by mis-merging of semantically-related lexical items, morphological markings and false part ... -
Programlamaya giriş dersi öğrencilerinin öz yeterlilik algıları ve derse yönelik tutumlarının cinsiyet ve eǧitim diline göre incelenmesi
(IEEE, 2017-10-31)Bu araştırmanın amacı F.M.V. Işık Üniversitesi Mühendislik Fakültesinde öğrenim gören öğrencilerin genel öz-yeterlilik algılarının ve Programlamaya Giriş(CSE101) dersine yönelik tutumlarının; cinsiyet ve eğitim aldıkları ... -
Programlamaya giriş dersini alan öğrencilerin programlama öz yeterlilik algılarının ve programlamaya bakış açılarının incelenmesi
(Düzce Üniversitesi, 2021-05-29)Bu çalışmada üniversite öğrencilerinin Java programlama öz yeterlilik algıları, programlama öğrenme istekleri ve çalışma alışkanlıkları çeşitli değişkenlere göre (cinsiyet, bölüm, eğitim dili, harf notu, ders tekrarları ... -
QoS-constrained core selection for group communication
(IEEE, 2005)The core-based approach in multipoint communication enhances the solution space in terms of QoS-efficiency of solutions in inter and intra-domain routing. In an earlier work [KH04], we showed that the constrained cost ... -
Quadratic programming for class ordering in rule induction
(Elsevier Science BV, 2015-03-01)Separate-and-conquer type rule induction algorithms such as Ripper, solve a K>2 class problem by converting it into a sequence of K - 1 two-class problems. As a usual heuristic, the classes are fed into the algorithm in ... -
Raylı sistemlerde yüksek gerilim aksamının otomatik denetimi
(IEEE, 2014-04-23)Raylı sistemlerde yolculugun sorunsuz tamamla-nabilmesi için sistem bütünlüğü kritik öneme sahiptir. Sistem bütünlüğü, lokomotif ve vagonlar haricinde katener (yüksek gerilim) hattı, pantograf ve raylara bağlıdır. Katener ... -
Regularizing soft decision trees
(Springer, 2013)Recently, we have proposed a new decision tree family called soft decision trees where a node chooses both its left and right children with different probabilities as given by a gating function, different from a hard ... -
A robust biclustering method based on crossing minimization in bipartite graphs
(Springer-Verlag Berlin, 2009)[No abstract available]
