10 citations · 25 across the 10 of their papers we have counts for
10 papers
Closed Walk Sampler: An Efficient Method for Estimating Eigenvalues of Large Graphs
Guyue Han, Harish Sethu
Eigenvalues of a graph are of high interest in graph analytics for Big Data due to their relevance to many important properties of the graph including network resilience, community…
On Counting Triangles through Edge Sampling in Large Dynamic Graphs
Guyue Han, Harish Sethu
Traditional frameworks for dynamic graphs have relied on processing only the stream of edges added into or deleted from an evolving graph, but not any additional related informatio…
A New Approach to Dimensionality Reduction for Anomaly Detection in Data Traffic
Tingshan Huang, Harish Sethu, Nagarajan Kandasamy
The monitoring and management of high-volume feature-rich traffic in large networks offers significant challenges in storage, transmission and computational costs. The predominant…
Waddling Random Walk: Fast and Accurate Mining of Motif Statistics in Large Graphs
Guyue Han, Harish Sethu
Algorithms for mining very large graphs, such as those representing online social networks, to discover the relative frequency of small subgraphs within them are of high interest t…
An Energy Balanced Dynamic Topology Control Algorithm for Improved Network Lifetime
Xiaoyu Chu, Harish Sethu
In wireless sensor networks, a few sensor nodes end up being vulnerable to potentially rapid depletion of the battery reserves due to either their central location or just the traf…
Cooperative Topology Control with Adaptation for Improved Lifetime in Wireless Sensor Networks
Xiaoyu Chu, Harish Sethu
Topology control algorithms allow each node in a wireless multi-hop network to adjust the power at which it makes its transmissions and choose the set of neighbors with which it co…