Suchergebnisse - "Sublinear time algorithms"

Approximating average parameters of graphs von 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 …”
Volltext

Time-Optimal Sublinear Algorithms for Matching and Vertex Cover von 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 …”
Volltext

SubLinearForce: Fully Sublinear-Time Force Computation for Large Complex Graph Drawing von 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 …”
Volltext

Finding cycles and trees in sublinear time von 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 …”
Volltext

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems von 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 …”
Volltext

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling von 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 …”
Volltext

Sublinear time approximation schemes for makespan minimization on parallel machines von 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 …”
Volltext

Sparse harmonic transforms II: best s-term approximation guarantees for bounded orthonormal product bases in sublinear-time von 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 …”
Volltext

Sublinear-Time Algorithms for Compressive Phase Retrieval von 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 …”
Volltext

Counting Stars and Other Small Subgraphs in Sublinear-Time von 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 …”
Volltext

Local reconstruction of low‐rank matrices and subspaces von 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) …”
Volltext

Sublinear Time Algorithms von 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 …”
Volltext

Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables von 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 …”
Volltext

An adaptivity hierarchy theorem for property testing von 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 …”
Volltext

Optimal Testing of Multivariate Polynomials over Small Prime Fields von 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 …”
Volltext

Random walks and forbidden minors III: \text\left(d\varepsilon ^\right)-time partition oracles for minor-free graph classes von 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 …”
Volltext

Compressed sensing with sparse binary matrices: Instance optimal error guarantees in near-optimal time von 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 …”
Volltext

Estimating the Weight of Metric Minimum Spanning Trees in Sublinear Time von 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 …”
Volltext

Estimating the number of connected components in sublinear time von 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 …”
Volltext

Approximating the Minimum Spanning Tree Weight in Sublinear Time von 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 …”
Volltext