94 results on '"Alex Thomo"'
Search Results
2. Efficient Computation of K-Edge Connected Components: An Empirical Analysis.
3. A Language-Agnostic Compression Framework for the Bitcoin Blockchain.
4. PubMed Retrieval with RAG Techniques.
5. Computing (1+epsilon)-Approximate Degeneracy in Sublinear Time.
6. Community Structure and Coherence in Digital Humanities Works.
7. Identifying Autism Spectrum Disorder Using Brain Networks: Challenges and Insights.
8. Brain network similarity using k-cores.
9. Nucleus Decomposition in Probabilistic Graphs: Hardness and Algorithms.
10. Dynamic Graph Summarization: Optimal and Scalable.
11. Practical Survey on MapReduce Subgraph Enumeration Algorithms.
12. Vectorising k-Truss Decomposition for Simple Multi-Core and SIMD Acceleration.
13. Identifying Important Features for Clinical Diagnosis of Thyroid Disorder.
14. Distributed Enumeration of Four Node Graphlets at Quadrillion-Scale.
15. Truss Decomposition on Large Probabilistic Networks using H-Index.
16. Fast and Scalable Triangle Counting in Graph Streams: The Hybrid Approach.
17. Triangle Enumeration for Billion-Scale Graphs in RDBMS.
18. Graph Summarization with Controlled Utility Loss.
19. Efficient Graph Summarization using Weighted LSH at Billion-Scale.
20. Approximating 4-cliques in streaming graphs: the power of dual sampling.
21. Multi-stage graph peeling algorithm for probabilistic core decomposition.
22. Triangle Enumeration on Massive Graphs Using AWS Lambda Functions.
23. PageRank for Billion-Scale Networks in RDBMS.
24. Efficient Enumeration of Four Node Graphlets at Trillion-Scale.
25. Vectorising k-Core Decomposition for GPU Acceleration.
26. Reverse Prevention Sampling for Misinformation Mitigation in Social Networks.
27. Strongly Minimal MapReduce Algorithms: A TeraSort Case Study.
28. Efficient Computation of Probabilistic Core Decomposition at Web-Scale.
29. Fast Truss Decomposition in Large-scale Probabilistic Graphs.
30. Triad Enumeration at Trillion-Scale Using a Single Commodity Machine.
31. Graph-XLL: a Graph Library for Extra Large Graph Analytics on a Single Machine.
32. Data Structures for Efficient Computation of Influence Maximization and Influence Estimation.
33. NoSingles: a space-efficient algorithm for influence maximization.
34. K-Truss Decomposition of Large Networks on a Single Consumer-Grade Machine.
35. k-core Decomposition on Giraph and GraphChi.
36. Efficient Implementation of Anchored 2-core Algorithm.
37. Group-Aware Weighted Bipartite B-Matching.
38. From Recommendation to Profile Inference (Rec2PI): A Value-added Service to Wi-Fi Data Mining.
39. Efficient Computation of Importance Based Communities in Web-Scale Networks Using a Single Machine.
40. Fuzzy joins in MapReduce: Edit and Jaccard distance.
41. An experimental evaluation of giraph and GraphChi.
42. Mining Association Rules in the BCCA Liver Cancer Data Set.
43. Incorporating User Reviews as Implicit Feedback for Improving Recommender Systems.
44. Utilizing Favorites Lists for Better Recommendations.
45. Semantic Graph Compression with Hypergraphs.
46. A case study of applying data mining to sensor data for contextual requirements analysis.
47. Zero-Knowledge Private Computation of Node Bridgeness in Social Networks.
48. Three-way joins on MapReduce: An experimental study.
49. View-Based Tree-Language Rewritings for XML.
50. How do biological networks differ from social networks? (an experimental study).
Catalog
Books, media, physical & digital resources
Discovery Service for Jio Institute Digital Library
For full access to our library's resources, please sign in.