DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection. | 0 | 0.34 | 2022 |
A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery | 0 | 0.34 | 2022 |
DeepTEA: Effective and Efficient Online Time-dependent Trajectory Outlier Detection. | 0 | 0.34 | 2022 |
Effective and Efficient Discovery of Top-k Meta Paths in Heterogeneous Information Networks | 0 | 0.34 | 2022 |
Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks | 0 | 0.34 | 2022 |
Finding Locally Densest Subgraphs: A Convex Programming Approach. | 0 | 0.34 | 2022 |
Fast augmentation algorithms for network kernel density visualization | 0 | 0.34 | 2021 |
On Analyzing Graphs with Motif-Paths. | 0 | 0.34 | 2021 |
Editorial Of Special Issue Of Wise 2019 | 0 | 0.34 | 2020 |
Integrating Domain Knowledge in AI-Assisted Criminal Sentencing of Drug Trafficking Cases. | 0 | 0.34 | 2020 |
M-Cypher: A GQL Framework Supporting Motifs | 0 | 0.34 | 2020 |
Traffic Incident Detection: A Trajectory-Based Approach | 1 | 0.39 | 2020 |
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs | 2 | 0.36 | 2020 |
SCODED: Statistical Constraint Oriented Data Error Detection | 1 | 0.35 | 2020 |
A Toolkit for Managing Multiple Crowdsourced Top-K Queries | 0 | 0.34 | 2020 |
Discovering Maximal Motif Cliques in Large Heterogeneous Information Networks | 2 | 0.39 | 2019 |
Efficient Algorithms for Densest Subgraph Discovery. | 0 | 0.34 | 2019 |
Efficient Algorithms for Densest Subgraph Discovery. | 9 | 0.47 | 2019 |
Exploring Communities in Large Profiled Graphs. | 1 | 0.35 | 2019 |
Detecting Data Errors with Statistical Constraints. | 0 | 0.34 | 2019 |
A Survey of Community Search Over Big Graphs. | 18 | 0.59 | 2019 |
On Spatial-Aware Community Search | 3 | 0.37 | 2019 |
Exploring Communities in Large Profiled Graphs (Extended Abstract) | 0 | 0.34 | 2019 |
Evaluating pattern matching queries for spatial databases. | 0 | 0.34 | 2019 |
An Efficient Framework for Correctness-Aware kNN Queries on Road Networks | 0 | 0.34 | 2019 |
Scalable Evaluation of k-NN Queries on Large Uncertain Graphs. | 0 | 0.34 | 2018 |
Entity-Based Query Recommendation for Long-Tail Queries. | 2 | 0.37 | 2018 |
STEM: a suffix tree-based method for web data records extraction | 0 | 0.34 | 2018 |
Entropy-Based Scheduling Policy for Cross Aggregate Ranking Workloads. | 0 | 0.34 | 2018 |
Efficient processing of shortest path queries in evolving graph sequences. | 1 | 0.37 | 2017 |
Efficient Pattern-Based Aggregation on Sequence Data | 0 | 0.34 | 2017 |
DOCS: Domain-Aware Crowdsourcing System. | 0 | 0.34 | 2017 |
Crowdsourced Data Management: Overview and Challenges. | 16 | 0.58 | 2017 |
Truth Inference in Crowdsourcing: Is the Problem Solved? | 75 | 1.67 | 2017 |
Truth Inference in Crowdsourcing: Is the Problem Solved? | 0 | 0.34 | 2017 |
Effective and efficient attributed community search. | 11 | 0.47 | 2017 |
Effective Community Search over Large Spatial Graphs. | 44 | 1.00 | 2017 |
C-Explorer: Browsing Communities in Large Graphs. | 0 | 0.34 | 2017 |
Effective Community Search for Large Attributed Graphs. | 54 | 1.17 | 2016 |
Fast and Semantic Measurements on Collaborative Tagging Quality. | 0 | 0.34 | 2016 |
Managing uncertainty of large spatial databases. | 0 | 0.34 | 2016 |
Querying Minimal Steiner Maximum-Connected Subgraphs in Large Graphs | 6 | 0.46 | 2016 |
Meta Structure: Computing Relevance in Large Heterogeneous Information Networks | 42 | 1.07 | 2016 |
KB-Enabled Query Recommendation for Long-Tail Queries | 7 | 0.46 | 2016 |
Crowdsourced POI labelling: Location-aware result inference and Task Assignment | 29 | 0.74 | 2016 |
DOCS: Domain-Aware Crowdsourcing System. | 0 | 0.34 | 2016 |
Efficient Top-k Subscription Matching for Location-Aware Publish/Subscribe | 6 | 0.41 | 2015 |
Online Influence Maximization | 14 | 0.70 | 2015 |
Walking in the Cloud: Parallel SimRank at Scale. | 16 | 0.58 | 2015 |
On using broadcast index for efficient execution of shortest path continuous queries | 5 | 0.40 | 2015 |