Abstract Content-based image retrieval (CBIR) methods search for points with the most similar content to query features from within a large dataset. The notable approach this purpose is an approximate nearest neighbor (ANN) searching. main properties expected system can be listed as follows; low storage requirement, high retrieve speed, and average precision. Hashing, which generate discriminat...

Abstract Analytic Hierarchy Process (AHP) is one of the multi-criteria decision-making methods that utilize pair-wise comparison in evaluation process. The method later extended to fuzzy environment cater and solve problem ambiguity imprecise information known as AHP. In process, issue incomplete has become a prevalent which may lead invalid biased results. occurs commonly due inefficiency or n...

Statistical estimation using pairwise comparison data is an effective approach to analyzing large-scale sparse networks. In this article, we propose a general framework model the mutual interactions in network, which enjoys ample flexibility terms of parameterization. Under setup, show that maximum likelihood estimator for latent score vector subjects uniformly consistent under near-minimal con...

A tournament is a binary dominance relation on a set of alternatives. Tournaments arise in many contexts that are relevant to AI, most notably in voting (as a method to aggregate the preferences of agents). There are many works that deal with choice rules that select a desirable alternative from a tournament, but very few of them deal directly with incentive issues, despite the fact that gameth...

Sequence comparison is one of the most fundamental computational problems in bioinformatics. Pairwise sequence alignment methods align two sequences using a substitution matrix consisting of pairwise scores of aligning different residues with each other (like BLOSUM62), and give an alignment score for the given sequence-pair. This work 1 addresses the problem of accurately estimating statistica...