Search Results - "sublinear-time algorithms"

Approximating average parameters of graphs by Goldreich, Oded, Ron, Dana

“…Inspired by Feige (36th STOC, 2004), we initiate a study of sublinear randomized algorithms for approximating average parameters of a graph. Specifically, we…”
Get full text

Time-Optimal Sublinear Algorithms for Matching and Vertex Cover by Behnezhad, Soheil

“…We study the problem of estimating the size of maximum matching and minimum vertex cover in sub linear time. Denoting the number of vertices by n and the…”
Get full text

SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing by Meidiana, Amyra, Hong, Seok-Hee, Cai, Shijun, Torkel, Marnijati, Eades, Peter

“…Recent works in graph visualization attempt to reduce the runtime of repulsion force computation of force-directed algorithms using sampling. However, they…”
Get full text

Finding cycles and trees in sublinear time by Czumaj, Artur, Goldreich, Oded, Ron, Dana, Seshadhri, C., Shapira, Asaf, Sohler, Christian

“…ABSTRACT We present sublinear‐time (randomized) algorithms for finding simple cycles of length at least k≥3 and tree‐minors in bounded‐degree graphs. The…”
Get full text

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems by Le Gall, François, Seddighin, Saeed

“…Longest common substring (LCS), longest palindrome substring (LPS), and Ulam distance (UL) are three fundamental string problems that can be classically solved…”
Get full text

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling by Aliakbarpour, Maryam, Biswas, Amartya Shankha, Gouleakis, Themis, Peebles, John, Rubinfeld, Ronitt, Yodpinyanee, Anak

“…We study the problem of estimating the value of sums of the form S p ≜ ∑ x i p when one has the ability to sample x i ≥ 0 with probability proportional to its…”
Get full text

Sublinear time approximation schemes for makespan minimization on parallel machines by Fu, Bin, Huo, Yumei, Zhao, Hairong

“…We study sublinear time algorithms for the classical makespan minimization problem of scheduling n jobs on m parallel machines. Under uniform random sampling…”
Get full text

Sparse harmonic transforms II: best s-term approximation guarantees for bounded orthonormal product bases in sublinear-time by Choi, Bosu, Iwen, Mark, Volkmer, Toni

“…In this paper we develop a sublinear-time compressive sensing algorithm for approximating functions of many variables which are compressible in a given Bounded…”
Get full text

Sublinear-Time Algorithms for Compressive Phase Retrieval by Li, Yi, Nakos, Vasileios

“…In the problem of compressed phase retrieval, the goal is to reconstruct a sparse or approximately <inline-formula> <tex-math notation="LaTeX">k…”
Get full text

Counting Stars and Other Small Subgraphs in Sublinear-Time by Gonen, Mira, Ron, Dana, Shavitt, Yuval

“…Detecting and counting the number of copies of certain subgraphs (also known as network motifs or graphlets) is motivated by applications in a variety of areas…”
Get full text

Local reconstruction of low‐rank matrices and subspaces by David, Roee, Goldenberg, Elazar, Krauthgamer, Robert

“…We study the problem of reconstructing a low‐rank matrix, where the input is an n × m matrix M over a field F and the goal is to reconstruct a (near‐optimal)…”
Get full text

Sublinear Time Algorithms by Rubinfeld, Ronitt, Shapira, Asaf

“…Sublinear time algorithms represent a new paradigm in computing, where an algorithm must give some sort of an answer after inspecting only a very small portion…”
Get full text

Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables by Choi, Bosu, Iwen, Mark A., Krahmer, Felix

“…In this paper we develop fast and memory efficient numerical methods for learning functions of many variables that admit sparse representations in terms of…”
Get full text

An adaptivity hierarchy theorem for property testing by Canonne, Clément L., Gur, Tom

“…Adaptivity is known to play a crucial role in property testing. In particular, there exist properties for which there is an exponential gap between the power…”
Get full text

Optimal Testing of Multivariate Polynomials over Small Prime Fields by Haramaty, Elad, Shpilka, Amir, Sudan, Madhu

“…We consider the problem of testing whether a given function $f : {\mathbb F}_q^n \rightarrow {\mathbb F}_q$ is close to an $n$-variate degree $d$ polynomial…”
Get full text

Random walks and forbidden minors III: \text\left(d\varepsilon ^\right)-time partition oracles for minor-free graph classes by Kumar, Akash, Seshadhri, C., Stolman, Andrew

“…Consider the family of bounded degree graphs in any minor-closed family (such as planar graphs). Let d be the degree bound and n be the number of vertices of…”
Get full text

Compressed sensing with sparse binary matrices: Instance optimal error guarantees in near-optimal time by Iwen, M.A.

“…A compressed sensing method consists of a rectangular measurement matrix, M∈Rm×N with m≪N, together with an associated recovery algorithm, A:Rm→RN. Compressed…”
Get full text

Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time by Czumaj, Artur, Sohler, Christian

“…In this paper the authors present a sublinear-time (1+...)-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point…”
Get full text

Estimating the number of connected components in sublinear time by Berenbrink, Petra, Krayenhoff, Bruce, Mallmann-Trenn, Frederik

“…We present an algorithm that estimates the number of connected components of a graph over n vertices within an additive error of εn in (sublinear) time…”
Get full text

Approximating the Minimum Spanning Tree Weight in Sublinear Time by Chazelle, Bernard, Rubinfeld, Ronitt, Trevisan, Luca

“…We present a probabilistic algorithm that, given a connected graph G (represented by adjacency lists) of average degree d, with edge weights in the…”
Get full text