59 citations · 72 across the 6 of their papers we have counts for
6 papers
TIMEST: Temporal Information Motif Estimator Using Sampling Trees
Yunjie Pan, Omkar Bhalerao, C. Seshadhri +1
The mining of pattern subgraphs, known as motifs, is a core task in the field of graph mining. Edges in real-world networks often have timestamps, so there is a need for temporal m…
Accurate and Fast Estimation of Temporal Motifs using Path Sampling
Yunjie Pan, Omkar Bhalerao, C. Seshadhri +1
Counting the number of small subgraphs, called motifs, is a fundamental problem in social network analysis and graph mining. Many real-world networks are directed and temporal, whe…
Bimodal Plasmonic Refractive Index Sensors Based on SU-8 Waveguides
Omkar Bhalerao, Stephan Suckow, Horst Windgassen +11
Plasmonic refractive index sensors are essential for detecting subtle variations in the ambient environment through surface plasmon interactions. Current efforts utilizing CMOS-com…
Large Scale Learning on Non-Homophilous Graphs: New Benchmarks and Strong Simple Methods
Derek Lim, Felix Hohne, Xiuyu Li +4
Many widely used datasets for graph machine learning tasks have generally been homophilous, where nodes with similar labels connect to each other. Recently, new Graph Neural Networ…
Edge Proposal Sets for Link Prediction
Abhay Singh, Qian Huang, Sijia Linda Huang +4
Graphs are a common model for complex relational data such as social networks and protein interactions, and such data can evolve over time (e.g., new friendships) and be noisy (e.g…
DEAP Cache: Deep Eviction Admission and Prefetching for Cache
Ayush Mangal, Jitesh Jain, Keerat Kaur Guliani +1
Recent approaches for learning policies to improve caching, target just one out of the prefetching, admission and eviction processes. In contrast, we propose an end to end pipeline…