Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
Measuring robustness in rank aggregation based on the error-effectiveness curve
Y **
personnel costs low to ensure profitability. Achieving this necessitates the study of …
personnel costs low to ensure profitability. Achieving this necessitates the study of …
Online topic-aware entity resolution over incomplete data streams
In many real applications such as the data integration, social network analysis, and the
Semantic Web, the entity resolution (ER) is an important and fundamental problem, which …
Semantic Web, the entity resolution (ER) is an important and fundamental problem, which …
Verifiable and Privacy-Preserving -NN Query Scheme with Multiple Keys
Y Zhang, B Wang, Z Zhao - IEEE Transactions on Big Data, 2024 - ieeexplore.ieee.org
As a basic primitive in spatial and multimedia databases, the-nearest neighbors (-NN) query
has been widely used in electronic medicine, location-based services and so on. With the …
has been widely used in electronic medicine, location-based services and so on. With the …
Secure k-NN Query With Multiple Keys Based on Random Projection Forests
Y Zhang, B Wang, Z Zhao - IEEE Internet of Things Journal, 2023 - ieeexplore.ieee.org
As a basic primitive in spatial and multimedia databases, the-nearest neighbors-NN) query
has been widely used in electronic medicine, location-based services, and so on. With the …
has been widely used in electronic medicine, location-based services, and so on. With the …
[PDF][PDF] Efficient Top-K Continuous Query Processing Over Sliding Window Model (SWM) Method on Uncertain Data Stream
Query processing using the Uncertain Data Stream (UDS) can be complex in many
technological scenarios due to inconsistencies, unclear information, and interpretation …
technological scenarios due to inconsistencies, unclear information, and interpretation …
PSATop-k: Approximate range top-k computation on big data
H Guo, J Li, H Gao, K Zhang - Knowledge-Based Systems, 2022 - Elsevier
Approximate top-k query returns a list of k tuples that have approximate largest scores with
respect to the user given query. However, existing algorithms cannot effectively process the …
respect to the user given query. However, existing algorithms cannot effectively process the …