Turnitin
降AI改写
早检测系统
早降重系统
Turnitin-UK版
万方检测-期刊版
维普编辑部版
Grammarly检测
Paperpass检测
checkpass检测
PaperYY检测
FHL-cube: Multi-constraint shortest path querying with flexible combination of constraints
Multi-Constraint Shortest Path (MCSP) generalizes the classic shortest path from single to
multiple criteria such that more personalized needs can be satisfied. However, MCSP query …
multiple criteria such that more personalized needs can be satisfied. However, MCSP query …
Global routing optimization in road networks
Route planning plays an increasingly important role in our society, and the routing results,
which are the paths that vehicles actually travel in a road network, which influence the traffic …
which are the paths that vehicles actually travel in a road network, which influence the traffic …
Gpu-accelerated graph label propagation for real-time fraud detection
Fraud detection is a pressing challenge for most financial and commercial platforms. In this
paper, we study the processing pipeline of fraud detection in a large e-commerce platform of …
paper, we study the processing pipeline of fraud detection in a large e-commerce platform of …
A Survey on Concurrent Processing of Graph Analytical Queries: Systems and Algorithms
Graph analytical queries (GAQs) are becoming increasingly important in various domains,
including social networks, recommendation systems, and bioinformatics, among others …
including social networks, recommendation systems, and bioinformatics, among others …
Accelerating Maximal Bicliques Enumeration with GPU on large scale network
Bicliques, as a prevalent graph pattern, are of particular interest in graph mining and social
network analysis, especially for detecting illegal activities on e-commerce platforms due to …
network analysis, especially for detecting illegal activities on e-commerce platforms due to …
Accelerating biclique counting on gpu
Counting (p, q)-bicliques in bipartite graphs poses a foundational challenge with broad
applications, from densest sub-graph discovery in algorithmic research to personalized …
applications, from densest sub-graph discovery in algorithmic research to personalized …
Self-adaptive graph traversal on gpus
GPU's massive computing power offers unprecedented opportunities to enable large graph
analysis. Existing studies proposed various preprocessing approaches that convert the input …
analysis. Existing studies proposed various preprocessing approaches that convert the input …
Efficient navigation for constrained shortest path with adaptive expansion control
In many route planning applications, finding constrained shortest paths (CSP) is an
important and fundamental problem. CSP aims to find the shortest path between two nodes …
important and fundamental problem. CSP aims to find the shortest path between two nodes …
A graph pattern mining framework for large graphs on GPU
Graph pattern mining (GPM) is an important problem in graph processing. There are many
parallel frameworks for GPM, many of which suffer from low performance. GPU is a powerful …
parallel frameworks for GPM, many of which suffer from low performance. GPU is a powerful …
Global Optimal Travel Planning for Massive Travel Queries in Road Networks
Travel planning plays an increasingly important role in our society. The travel plans, which
consist of the paths each vehicle is suggested to follow and its corresponding departure …
consist of the paths each vehicle is suggested to follow and its corresponding departure …