Results 21 to 30 of about 9,334,973 (302)
One-Pot Isothermal LAMP-CRISPR-Based Assay for Klebsiella pneumoniae Detection
Microbiology Spectrum, 2022 Klebsiella pneumoniae (K. pneumoniae) is one of the most common pathogens causing nosocomial infection. A rapid, accurate, and convenient detection method is required for early diagnosis and directed therapy of K. pneumoniae infection. CRISPR-top (CRISPR-
Xiaotong Qiu +6 more
doaj +1 more source
Stochastic Top-k ListNet [PDF]
Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, 2015 ListNet is a well-known listwise learning to rank model and has gained much attention in recent years. A particular problem of ListNet, however, is the high computation complexity in model training, mainly due to the large number of object permutations involved in computing the gradients. This paper proposes a stochastic ListNet approach which computes
Tianyi Luo +3 more
openaire +2 more sources
Distributed top-k aggregation queries at large [PDF]
, 2009 Top-k query processing is a fundamental building block for efficient ranking in a large number of applications. Efficiency is a central issue, especially for distributed settings, when the data is spread across different nodes in a network.
Neumann, T. +17 more
core +1 more source
, 2023 Regarding the fulfillment optimization of online retail orders, many researchers focus more on warehouse optimization and distribution center optimization.
Jiaxu Liu (3233178) +2 more
core +1 more source
Top-K Collective Spatial Keyword Queries
IEEE Access, 2019 With the advent of a large number of spatial-textual data, collective spatial keyword queries have been widely studied in recent years. However, the collective spatial keyword query studied so far usually looks for only a set of objects. In addition, the
Danni Su +4 more
doaj +1 more source
Video Popularity Prediction: An Autoencoder Approach With Clustering
IEEE Access, 2020 Autoencoders implemented by artificial neural networks (ANNs) are utilized to learn the latent space representation of data in an unsupervised manner, and they have been widely used in recommender systems.
Yu-Tai Lin +2 more
doaj +1 more source
Shortlisting top-K assignments [PDF]
Proceedings of the 25th International Conference on Scientific and Statistical Database Management, 2013 In this paper we identify a novel query type, the top-K assignment query (αTop-K). Consider a set of objects and a set of suppliers, where each object must be assigned to one supplier. Assume that there is a cost associated with every object-supplier pair.
Yimin Lin, Kyriakos Mouratidis
openaire +2 more sources
Fast Top-K Graph Similarity Search Via Representative Matrices
IEEE Access, 2018 Graph similarity search is a crucial problem in many applications, such as cheminformatics, data mining, and pattern recognition. Top-k graph similarity search aims to find the most similar k graphs to a query graph in graph databases.
Zhigang Sun, Hongwei Huo, Xiaoyang Chen
doaj +1 more source
Sketch‐BF: A fast algorithm for finding top‐k flows
Electronics Letters, 2022 Finding top‐k flows plays an essential role for many network managements. Since the line rates keep increasing in networks, finding top‐k flows precisely and quickly becomes more challenging.
Jie Lu +4 more
doaj +1 more source
CoRR, 2020 Assessors make preference judgments faster and more consistently than graded judgments. Preference judgments can also recognize distinctions between items that appear equivalent under graded judgments. Unfortunately, preference judgments can require more than linear effort to fully order a pool of items, and evaluation measures for preference judgments
Charles L. A. Clarke +2 more
openaire +2 more sources