Başlık için Bilgisayar Mühendisliği Bölümü / Department of Computer Engineering listeleme
Toplam kayıt 188, listelenen: 150-169
-
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] -
Robust localization and identification of African clawed frogs in digital images
(Elsevier Science BV, 2014-09)We study the automatic localization and identification of African clawed frogs (Xenopus laevis sp.) in digital images taken in a laboratory environment. We propose a novel and stable frog body localization and skin pattern ... -
A robust localization framework to handle noisy measurements in wireless sensor networks
(IEEE, 2009-09-14)We construct a robust localization framework to handle noisy measurements in wireless sensor networks. Traditionally many approaches employ the distance information gathered from ranging devices of the sensor nodes to ... -
The routine design-modular distributed modeling platform for distributed routine design and simulation-based testing of distributed assemblies
(Cambridge University Press, 2008-12-12)In this paper we describe a conceptual framework and implementation of a tool that supports task-directed, distributed routine design (RD) augmented with simulation-based design testing. In our research, we leverage the ... -
Sadece kaynak kod kullanarak otomatik yorum oluşturma
(IEEE, 2017-06-27)Bu çalışmada, kaynak kodlara metot seviyesinde yorum ekleme işinin otomatikleştirilmesi anlatılmaktadır. Kodların, Java programlama dilinin sözdizim kurallarına uygun olması yeterli olup, çalışabilir durumda olması ... -
Searching for the optimal ordering of classes in rule induction
(IEEE, 2012-11-15)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 the order of increasing ... -
Semi-automatic adaptation of high-polygon wireframe face models through inverse perspective projection
(Springer-Verlag, 2012)Precise registration of a generic 3D face model with a subject's face is a critical stage for model based analysis of facial expressions. In this study we propose a semi-automatic model fitting algorithm to fit a high-polygon ... -
Ses haritası: Bir çevresel gürültü izleme algılayıcı ağı
(IEEE, 2016-06-20)Çalıştığımız ortamlardaki çevresel gürültünün seviyesi psikolojik ve fiziksel sağlığımız ve iş verimliliği açısından kritik önem taşımaktadır. Bu nedenle çevresel gürültüyü gözlemleyen sistemlere ihtiyaç duyulmaktadır. Bu ... -
Shallow parsing in Turkish
(IEEE, 2017)In this study, shallow parsing is applied on Turkish sentences. These sentences are used to train and test the per-formances of various learning algorithms with various features specified for shallow parsing in Turkish. -
Soft decision trees
(IEEE, 2012)We discuss a novel decision tree architecture with soft decisions at the internal nodes where we choose both children with probabilities given by a sigmoid gating function. Our algorithm is incremental where new nodes are ... -
Software defect prediction using Bayesian networks
(Springer, 2014-02)There are lots of different software metrics discovered and used for defect prediction in the literature. Instead of dealing with so many metrics, it would be practical and easy if we could determine the set of metrics ... -
SPD (Static Priority with Deadline considerations) packet scheduling algorithm for achieving better QoS
(IEEE, 2007)Providing quality of service (QoS) to applications with different traffic characteristics based on their needs is an important research area for today's and tomorrow's high speed networks. Various techniques have been ... -
Statistical tests using hinge/ε-sensitive loss
(Springer-Verlag, 2013)Statistical tests used in the literature to compare algorithms use the misclassification error which is based on the 0/1 loss and square loss for regression. Kernel-based, support vector machine classifiers (regressors) ... -
Student conference as a student centred environment for integrating technical writings into computer engineering curriculum
(Anı Yayıncılık, 2011-12)Problem Statement: In today's world there are pressures on universities to ensure that graduates have the capacity to meet the needs of employers. One aspect of this is to ensure that students, along with professional ... -
Subset selection for tuning of hyper-parameters in artificial neural networks
(IEEE, 2017)Hyper-parameters of a machine learning architecture define its design. Tuning of hyper-parameters is costly and for large data sets outright impractical, whether it is performed manually or algorithmically. In this study ... -
Sınıflandırma için diferansiyel mahremiyete dayalı öznitelik seçimi
(Gazi Univ, Fac Engineering Architecture, 2018)Veri madenciliği ve makine öğrenmesi çözümlerinin en önemli ön aşamalarından biri yapılacak analizde kullanılacak verinin özniteliklerinin uygun bir alt kümesini belirlemektir. Sınıflandırma yöntemleri için bu işlem, bir ... -
Texture recognition for frog identification
(ACM SIGMM, 2012-11-02)This paper describes a visual processing technique for automatic frog (Xenopus Laevis sp.) localization and identification. The problem of frog identification is to process and classify an unknown frog image to determine ... -
Tree Ensembles on the induced discrete space
(Institute of Electrical and Electronics Engineers Inc., 2016-05)Decision trees are widely used predictive models in machine learning. Recently, K-tree is proposed, where the original discrete feature space is expanded by generating all orderings of values of k discrete attributes and ...