Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Efficient algorithms for k-regret minimizing sets
A regret minimizing set Q is a small size representation of a much larger database P so that
user queries executed on Q return answers whose scores are not much worse than those on …
user queries executed on Q return answers whose scores are not much worse than those on …
Comparative study of Topk based on Fagin's algorithm using correlation metrics in cloud computing QoS
With the exponential growth of cloud computing services recently, several internet
technologies began to require the processing of multi-criteria ranking. The collaborative …
technologies began to require the processing of multi-criteria ranking. The collaborative …
Efficient approaches to k representative g-skyline queries
The G-Skyline (GSky) query is a powerful tool to analyze optimal groups in decision support.
Compared with other group skyline queries, it releases users from providing an aggregate …
Compared with other group skyline queries, it releases users from providing an aggregate …
Space filling approach for distributed processing of top-k dominating queries
A top-k dominating query returns k data objects that dominate the highest number of data
objects in a given dataset. This query provides us with a set of intuitively preferred data, thus …
objects in a given dataset. This query provides us with a set of intuitively preferred data, thus …
Efficient processing of top k group skyline queries
For a given multi-dimensional data set, a group skyline query returns the optimal groups not
dominated by any other group of equal size. The group skyline query is a powerful tool in …
dominated by any other group of equal size. The group skyline query is a powerful tool in …
Graph threshold algorithm
Recently more and more information sources are connected together and become a sort of
complex graphs that can be exploited not only as a structured and semi-structured data such …
complex graphs that can be exploited not only as a structured and semi-structured data such …
Parallel processing of top-k dominating queries on incomplete data
X Ding, C Yan, Y Zhao - 2018 IEEE 4th international …, 2018 - ieeexplore.ieee.org
A top-k dominating query returns the k objects dominating the maximum number of objects
in a given dataset. It combines the advantages of skyline queries and top-k queries, and …
in a given dataset. It combines the advantages of skyline queries and top-k queries, and …
Scalable similarity joins of tokenized strings
A Metwally, CH Huang - 2019 IEEE 35th International …, 2019 - ieeexplore.ieee.org
This work tackles the problem of fuzzy joining of strings that naturally tokenize into
meaningful substrings, eg, full names. Tokenized-string joins have several established …
meaningful substrings, eg, full names. Tokenized-string joins have several established …
A Top-K Retrieval algorithm based on a decomposition of ranking functions
A Top-k retrieval algorithm returns the k best answers of a query according to a given
ranking. From a theoretical point of view, the solution of this query is straightforward if we do …
ranking. From a theoretical point of view, the solution of this query is straightforward if we do …