Ara
Toplam kayıt 27, listelenen: 1-10
Fast algorithm analysis and bit-serial architecture design for sub-pixel motion estimation in H.264
(World Scientific Publishing Company, 2010-12)
The sub-pixel motion estimation (SME), together with the interpolation of reference frames, is a computationally extensive part of the H.264 encoder that increases the memory requirement 16-times for each reference frame. ...
Re-mining positive and negative association mining results
(Springer-Verlag Berlin, 2010)
Positive and negative association mining are well-known and extensively studied data mining techniques to analyze market basket data. Efficient algorithms exist to find both types of association, separately or simultaneously. ...
Force-directed approaches to sensor localization
(Assoc Computing Machinery, 2010-09)
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 ...
Aynı oteli temsil eden farklı kayıtlar için akıllı eşleştirme
(Institute of Electrical and Electronics Engineers Inc., 2019-09)
Otel sayısının her geçen gün arttığı turizm sektöründe, aracı firmaların tüm oteller ile ayrı ayrı çalışma imkanı bulunmadığından, firmalar dünya üzerinde bir çok otelle anlaşması bulunan servis sağlayıcılarıyla beraber ...
Eigenclassifiers for combining correlated classifiers
(Elsevier Science Inc, 2012-03-15)
In practice, classifiers in an ensemble are not independent. This paper is the continuation of our previous work on ensemble subset selection [A. Ulas, M. Semerci, O.T. Yildiz, E. Alpaydin, Incremental construction of ...
Unsupervised morphological analysis using tries
(Springer London, 2012)
This article presents an unsupervised morphological analysis algorithm to segment words into roots and affixes. The algorithm relies on word occurrences in a given dataset. Target languages are English, Finnish, and Turkish, ...
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 ...
The economic lot-sizing problem with perishable items and consumption order preference
(Elsevier Science BV, 2015-08-01)
We consider the economic lot-sizing problem with perishable items (ELS-PI), where each item has a deterministic expiration date. Although all items in stock are equivalent regardless of procurement or expiration date, we ...
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 ...
Cooperative multiple access under energy harvesting constraints
(Institute of Electrical and Electronics Engineers Inc, 2015)
We consider a cooperative multiple access channel (MAC) with two energy harvesting transmitters. The transmitters perform delay constrained transmission, i.e., every information block is encoded, transmitted and decoded ...