Browsing MF  Makale Koleksiyonu  Bilgisayar Mühendisliği Bölümü / Department of Computer Science by Title
Now showing items 2140 of 48

A factorized high dimensional model representation on the nodes of a finite hyperprismatic regular grid
(Elsevier Science inc, 200505)When the values of a multivariate function f(x(1),...,x(N)), having N independent variables like x(1),...,x(N) are given at the nodes of a cartesian, product set in the space of the independent variables and ail interpolation ... 
ForceDirected Approaches to Sensor Localization
(ASSOC COMPUTING MACHINERY, 201009)As the number of applications of sensor networks increases, so does the interest in sensor network localization, that is, in recovering the correct position of each node in a network of sensors from partial connectivity ... 
Fully Decentralized and Collaborative Multilateration Primitives for Uniquely Localizing WSNs
(SPRINGER INTERNATIONAL PUBLISHING AG, 2009)We provide primitives for uniquely localizing WSN nodes. The goal is to maximize the number of uniquely localized nodes assuming a fully decentralized model of computation. Each node constructs a cluster of its own and ... 
A hybrid approach to private record matching
(IEEE COMPUTER SOC, 201210)Realworld entities are not always represented by the same set of features in different data sets. Therefore, matching records of the same realworld entity distributed across these data sets is a challenging task. If the ... 
Hybrid high dimensional model representation (HHDMR) on the partitioned data
(Elsevier B.V, 2006)A multivariate interpolation problem is generally constructed for appropriate determination of a multivariate function whose values are given at a finite number of nodes of a multivariate grid. One way to construct the ... 
Implicit theories and selfefficacy in an introductory programming course
(IEEEInst Electrical Electronics Engineers Inc, 20180801)Contribution: This paper examined student effort and performance in an introductory programming course with respect to studentheld implicit theories and selfefficacy. Background: Implicit theories and selfefficacy ... 
Incremental construction of classifier and discriminant ensembles
(ELSEVIER SCIENCE INC, 20090415)We discuss approaches to incrementally construct an ensemble. The first constructs an ensemble of classifiers choosing a subset from a larger set, and the second constructs an ensemble of discriminants, where a classifier ... 
Integrating vendors into cooperative design practices
(TAYLOR & FRANCIS LTD, 2009)This paper describes a new approach to cooperative design using distributed, offtheshelf design components. The ultimate goal is to enable assemblers to rapidly design their products and perform simulations using parts ... 
Kaotik kriptografinin çilesi
(IEEE, 2013)Despite being an active research area for the last two decades, chaotic cryptography has not found a place in mainstream cryptography literature. This paper explores the reasons for this separation. 
Mapping classifiers and datasets
(PERGAMONELSEVIER SCIENCE LTD, 201104)Given the posterior probability estimates of 14 classifiers on 38 datasets, we plot twodimensional maps of classifiers and datasets using principal component analysis (PCA) and Isomap. The similarity between classifiers ... 
Mobile applications discovery: a subscribercentric approach
(WILEY PERIODICALS, 201103)Rapid adoption of smartphones and the business success of the Apple App Store have resulted in the rampant growth of mobile applications. Seeking new revenue opportunities from application development has created a gold ... 
Model selection in omnivariate decision trees using Structural Risk Minimization
(ELSEVIER SCIENCE INC, 201112)As opposed to trees that use a single type of decision node, an omnivariate decision tree contains nodes of different types. We propose to use Structural Risk Minimization (SRM) to choose between node types in omnivariate ... 
Modeling and simulation support to the defense planning process
(SAGE Publications Inc., 201704)Defense planning is a crucial part of the defense process. It identifies the capabilities required for the future defense environment, analyzes the capability shortfalls, prioritizes them, and provides the fundamental ... 
Nearest neighbor weighted average customization for modeling faces
(Springer Berlin Heidelberg, 201310)In this paper, we present an anatomically accurate generic wireframe face model and an efficient customization method for modeling human faces. We use a single 2D image for customization of the generic model. We employ ... 
A novel kernel to predict software defectiveness
(Elsevier Science Inc., 201609)Although the software defect prediction problem has been researched for a long time, the results achieved are not so bright. In this paper, we propose to use novel kernels for defect prediction that are based on the ... 
An observation based muscle model for simulation of facial expressions
(Elsevier Science Bv, 201805)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 ... 
Omnivariate Rule Induction Using a Novel Pairwise Statistical Test
(IEEE Computer Soc, 201309)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 the feature extraction in discrete space
(ELSEVIER SCI LTD., 201405)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 ... 
Parallel univariate decision trees
(Elsevier B.V, 20070501)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 ... 
Quadratic programming for class ordering in rule induction
(ELSEVIER SCIENCE BV, 20150301)Separateandconquer type rule induction algorithms such as Ripper, solve a K>2 class problem by converting it into a sequence of K  1 twoclass problems. As a usual heuristic, the classes are fed into the algorithm in ...