6 sonuçlar
Arama Sonuçları
Listeleniyor 1 - 6 / 6
Yayın A survey of algorithms and architectures for H.264 sub-pixel motion estimation(World Scientific, 2012-05) Fatemi, Mohammad Reza Hosseiny; Ateş, Hasan Fehmi; Salleh, Rosli BinThis paper reviews recent state-of-the-art H. 264 sub-pixel motion estimation (SME) algorithms and architectures. First, H.264 SME is analyzed and the impact of its functionalities on coding performance is investigated. Then, design space of SME algorithms is explored representing design problems, approaches, and recent advanced algorithms. Besides, design challenges and strategies of SME hardware architectures are discussed and promising architectures are surveyed. Further perspectives and future prospects are also presented to highlight emerging trends and outlook of SME designs.Yayın A hybrid approach to private record matching(IEEE Computer Soc, 2012-10) İnan, Ali; Kantarcıoğlu, Murat; Ghinita, Gabriel; Bertino, ElisaReal-world entities are not always represented by the same set of features in different data sets. Therefore, matching records of the same real-world entity distributed across these data sets is a challenging task. If the data sets contain private information, the problem becomes even more difficult. Existing solutions to this problem generally follow two approaches: sanitization techniques and cryptographic techniques. We propose a hybrid technique that combines these two approaches and enables users to trade off between privacy, accuracy, and cost. Our main contribution is the use of a blocking phase that operates over sanitized data to filter out in a privacy-preserving manner pairs of records that do not satisfy the matching condition. We also provide a formal definition of privacy and prove that the participants of our protocols learn nothing other than their share of the result and what can be inferred from their share of the result, their input and sanitized views of the input data sets (which are considered public information). Our method incurs considerably lower costs than cryptographic techniques and yields significantly more accurate matching results compared to sanitization techniques, even when privacy requirements are high.Yayın Dendrimers are the unique chemical trees with maximum spectral radius(Univ Kragujevac, 2012) Bıyıkoğlu, Türker; Leydold, JosefIt is shown that dendrimers have maximum spectral radius and maximum Collatz-Sinogowitz index among all chemical trees of given size. The result is also generalized for the class of chemical trees with prescribed number of pendant vertices.Yayın Univariate decision tree induction using maximum margin classification(Oxford Univ Press, 2012-03) Yıldız, Olcay TanerIn many pattern recognition applications, first decision trees are used due to their simplicity and easily interpretable nature. In this paper, we propose a new decision tree learning algorithm called univariate margin tree where, for each continuous attribute, the best split is found using convex optimization. Our simulation results on 47 data sets show that the novel margin tree classifier performs at least as good as C4.5 and linear discriminant tree (LDT) with a similar time complexity. For two-class data sets, it generates significantly smaller trees than C4.5 and LDT without sacrificing from accuracy, and generates significantly more accurate trees than C4.5 and LDT for multiclass data sets with one-vs-rest methodology.Yayın Chunking in Turkish with conditional random fields(Springer-Verlag, 2015-04-14) Yıldız, Olcay Taner; Solak, Ercan; Ehsani, Razieh; Görgün, OnurIn this paper, we report our work on chunking in Turkish. We used the data that we generated by manually translating a subset of the Penn Treebank. We exploited the already available tags in the trees to automatically identify and label chunks in their Turkish translations. We used conditional random fields (CRF) to train a model over the annotated data. We report our results on different levels of chunk resolution.Yayın Robust stability analysis of a class of neural networks with discrete time delays(Pergamon-Elsevier Science Ltd, 2012-05) Faydasıçok, Özlem; Arik, SabriThis paper studies the existence, uniqueness and global asymptotic stability of the equilibrium point for the class of neural networks with discrete constant time delays under parameter uncertainties. The class of the neural network considered in this paper employs the activation functions which are assumed to be continuous and slope-bounded but not required to be bounded or differentiable. We conduct a stability analysis by exploiting the stability theory of Lyapunov functionals and the theory of Homomorphic mapping to derive some easily verifiable sufficient conditions for existence, uniqueness and global asymptotic stability of the equilibrium point. The conditions obtained mainly establish some time-independent relationships between the network parameters of the neural network. We make a detailed comparison between our results and the previously published corresponding results. This comparison proves that our results are new and improve and generalize the results derived in the past literature. We also give some illustrative numerical examples to show the effectiveness and applicability of our proposed stability results.
