106 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. An effective keyword search co-occurrence multi-layer graph mining approach.
5. Refactoring Index Tuning Process with Benefit Estimation.
6. Common-Truss-Based Community Search on Multilayer Graphs.
7. BM2CP: Efficient Collaborative Perception with LiDAR-Camera Modalities.
8. Can Uncertainty Quantification Enable Better Learning-based Index Tuning?
9. Closeness Centrality on Uncertain Graphs.
10. gCore: Exploring Cross-layer Cohesiveness in Multi-layer Graphs.
11. MSDS: A Novel Framework for Multi-Source Data Selection Based Cross-Network Node Classification.
12. Durable Subgraph Matching on Temporal Graphs.
13. Community Detection On Multi-layer Graph using Intra-layer and Inter-layer Linkage Graphs (CDMIILG).
14. On flexible cohesive subgraph mining.
15. Effective and efficient aggregation on uncertain graphs.
16. Query Generation based on Generative Adversarial Networks.
17. Diversified Top-k Querying in Knowledge Graphs.
18. Subgraph matching on temporal graphs.
19. Distributed processing of regular path queries in RDF graphs.
20. Budget Constrained Interactive Search for Multiple Targets.
21. Multi-Layer Stochastic Block Interaction driven by Logistic Regression (MLSBI-LR) for Efficient Link Recommendation in Intra-Layer Linkage Graphs.
22. Cardinality estimation via learned dynamic sample selection.
23. Detecting maximum k-durable structures on temporal graphs.
24. Distributed Parallel Structural Hole Detection on Big Graphs.
25. Leon: A Distributed RDF Engine for Multi-query Processing.
26. Graph Compression with Stars.
27. Diversified Coherent Core Search on Multi-Layer Graphs.
28. Fast Rectangle Counting on Massive Networks.
29. Fast diversified coherent core search on multi-layer graphs.
30. Evolving subgraph matching on temporal graphs.
31. Efficient Subgraph Matching on Non-volatile Memory.
32. Scalable Processing of Massive Uncertain Graph Data: A Simultaneous Processing Approach.
33. Budget Constrained Interactive Search for Multiple Targets.
34. Bitruss Decomposition of Bipartite Graphs.
35. Approximate Iceberg Cube on Heterogeneous Dimensions.
36. Triangle-Based Representative Possible Worlds of Uncertain Graphs.
37. Minimum Spanning Tree on Uncertain Graphs.
38. SimRank computation on uncertain graphs.
39. Truss decomposition of uncertain graphs.
40. Towards efficient top-k reliability search on uncertain graphs.
41. Minimized-cost cube query on heterogeneous information networks.
42. SimRank on Uncertain Graphs.
43. Flexible Aggregation on Heterogeneous Information Networks.
44. Top-k Reliability Search on Uncertain Graphs.
45. Determining the Real Data Completeness of a Relational Dataset.
46. Multi-way Theta-Join Based on CMD Storage Method.
47. Structural-Context Similarities for Uncertain Graphs.
48. QuickIM: Efficient, Accurate and Robust Influence Maximization Algorithm on Billion-Scale Networks.
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.