57 results on '"Zhaonian Zou"'
Search Results
2. Fast Multilayer Core Decomposition and Indexing.
3. Distance-Aware Attentive Framework for Multi-Agent Collaborative Perception in Presence of Pose Error.
4. Refactoring Index Tuning Process with Benefit Estimation.
5. Common-Truss-Based Community Search on Multilayer Graphs.
6. BM2CP: Efficient Collaborative Perception with LiDAR-Camera Modalities.
7. Closeness Centrality on Uncertain Graphs.
8. gCore: Exploring Cross-layer Cohesiveness in Multi-layer Graphs.
9. MSDS: A Novel Framework for Multi-Source Data Selection Based Cross-Network Node Classification.
10. Durable Subgraph Matching on Temporal Graphs.
11. Community Detection On Multi-layer Graph using Intra-layer and Inter-layer Linkage Graphs (CDMIILG).
12. Query Generation based on Generative Adversarial Networks.
13. BM2CP: Efficient Collaborative Perception with LiDAR-Camera Modalities.
14. On flexible cohesive subgraph mining.
15. Effective and efficient aggregation on uncertain graphs.
16. Diversified Top-k Querying in Knowledge Graphs.
17. Subgraph matching on temporal graphs.
18. Distributed processing of regular path queries in RDF graphs.
19. Budget Constrained Interactive Search for Multiple Targets.
20. Multi-Layer Stochastic Block Interaction driven by Logistic Regression (MLSBI-LR) for Efficient Link Recommendation in Intra-Layer Linkage Graphs.
21. Cardinality estimation via learned dynamic sample selection.
22. Detecting maximum k-durable structures on temporal graphs.
23. Distributed Parallel Structural Hole Detection on Big Graphs.
24. Leon: A Distributed RDF Engine for Multi-query Processing.
25. Graph Compression with Stars.
26. Diversified Coherent Core Search on Multi-Layer Graphs.
27. Fast Rectangle Counting on Massive Networks.
28. Fast diversified coherent core search on multi-layer graphs.
29. Evolving subgraph matching on temporal graphs.
30. Efficient Subgraph Matching on Non-volatile Memory.
31. Scalable Processing of Massive Uncertain Graph Data: A Simultaneous Processing Approach.
32. Budget Constrained Interactive Search for Multiple Targets.
33. Bitruss Decomposition of Bipartite Graphs.
34. Approximate Iceberg Cube on Heterogeneous Dimensions.
35. Triangle-Based Representative Possible Worlds of Uncertain Graphs.
36. Minimum Spanning Tree on Uncertain Graphs.
37. SimRank computation on uncertain graphs.
38. Truss decomposition of uncertain graphs.
39. Towards efficient top-k reliability search on uncertain graphs.
40. Minimized-cost cube query on heterogeneous information networks.
41. SimRank on Uncertain Graphs.
42. Flexible Aggregation on Heterogeneous Information Networks.
43. Top-k Reliability Search on Uncertain Graphs.
44. Determining the Real Data Completeness of a Relational Dataset.
45. Multi-way Theta-Join Based on CMD Storage Method.
46. WISE: Workload-Aware Partitioning for RDF Systems.
47. QuickIM: Efficient, Accurate and Robust Influence Maximization Algorithm on Billion-Scale Networks.
48. Structural-Context Similarities for Uncertain Graphs.
49. Finding top-k maximal cliques in an uncertain graph.
50. Discovering frequent subgraphs over uncertain graph databases under probabilistic semantics.
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.