Search Results - "Near-Linear Time Algorithm"

Tight Lower Bounds for Directed Cut Sparsification and Distributed Min-Cut by Cheng, Yu, Li, Max, Lin, Honghao, Tai, Zi-Yi, Woodruff, David P, Zhang, Jason

“…In this paper, we consider two fundamental cut approximation problems on large graphs. We prove new lower bounds for both problems that are optimal up to…”
Get more information

ACGraph: Accelerating Streaming Graph Processing via Dependence Hierarchy by Jiang, Zihan, Mao, Fubing, Guo, Yapu, Liu, Xu, Liu, Haikun, Liao, Xiaofei, Jin, Hai, Zhang, Wei

“…Streaming graph processing needs to timely evaluate continuous queries. Prior systems suffer from massive redundant computations due to the irregular order of…”
Get full text

Subspace exploration: Bounds on Projected Frequency Estimation by Cormode, Graham, Dickens, Charlie, Woodruff, David P

“…Given an n × d dimensional dataset A, a projection query specifies a subset C ⊆ [d] of columns which yields a new n × |C| array. We study the space complexity…”
Get more information

Force-Directed Graph Layouts by Edge Sampling by Gove, Robert

“…Recent work shows that sampling algorithms can be an effective tool for graph visualization. This paper extends prior work by applying edge sampling algorithms…”
Get full text

A Unified Framework to Estimate Global and Local Graphlet Counts for Streaming Graphs by Chen, Xiaowei, Lui, John C.S.

“…Counting small connected subgraph patterns called graphlets is emerging as a powerful tool for exploring topological structure of networks and for analysis of…”
Get full text

HyperHeadTail: a Streaming Algorithm for Estimating the Degree Distribution of Dynamic Multigraphs by Stolman, Andrew, Matulef, Kevin

“…We introduce HyperHeadTail, a streaming algorithm for estimating the degree distribution of a graph from a stream of edges using very little storage space…”
Get full text

Streaming Graph Sampling with Size Restrictions by Zakrzewska, Anita, Bader, David A.

“…Many graph datasets originating from online social network, financial or biological sources are too large to store or analyze. The analysis of such networks…”
Get full text

Geometry-oblivious FMM for compressing dense SPD matrices by Yu, Chenhan D., Levitt, James, Reiz, Severin, Biros, George

“…We present GOFMM (geometry-oblivious FMM), a novel method that creates a hierarchical low-rank approximation, or "compression," of an arbitrary dense symmetric…”
Get full text

Capacity management for streaming applications over cloud infrastructures with micro billing models by Tolosana-Calasanz, Rafael, Diaz-Montes, Javier, Bittencourt, Luiz F., Rana, Omer, Parashar, Manish

“…Recent advances in sensor technologies and instrumentation have led to an extraordinary growth of data sources and streaming applications. A wide variety of…”
Get full text