Výsledky vyhľadávania - "Sublinear-time algorithms"

Sublinear Time Algorithms Autor 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 of the input…”
Získať plný text

Sublinear-Time Algorithms for Counting Star Subgraphs via Edge Sampling Autor 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…”
Získať plný text

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

“… of <inline-formula> <tex-math notation="LaTeX">v\in \mathbb {C} ^{n} </tex-math></inline-formula> coordinate-wise. In this paper we present sublinear-time algorithms…”
Získať plný text

Sublinear time algorithms for approximate semidefinite programming Autor Garber, Dan, Hazan, Elad

“…We consider semidefinite optimization in a saddle point formulation where the primal solution is in the spectrahedron and the dual solution is a distribution…”
Získať plný text

Bi-criteria sublinear time algorithms for clustering with outliers in high dimensions Autor Huang, Jiawei, Liu, Wenjie, Ding, Hu

“…•Research highlight 1 This paper introduces a novel uniform sampling framework for solving k-means/ median clustering with outliers problems. The key…”
Získať plný text

Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance Autor Kociumaka, Tomasz, Saha, Barna

“…In this paper, we design new sublinear-time algorithms for solving the gap edit distance problem and for embedding edit distance to Hamming distance…”
Získať plný text

Sparse Harmonic Transforms: A New Class of Sublinear-Time Algorithms for Learning Functions of Many Variables Autor 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…”
Získať plný text

Sublinear Time Algorithms for Earth Mover’s Distance Autor Ba, Khanh Do, Nguyen, Huy L., Nguyen, Huy N., Rubinfeld, Ronitt

“…We study the problem of estimating the Earth Mover’s Distance (EMD) between probability distributions when given access only to samples of the distribution. We…”
Získať plný text

Sublinear-time Algorithms for Stress Minimization in Graph Drawing Autor Meidiana, Amyra, Wood, James, Hong, Seok-Hee

“… Descent.Experimental results demonstrate that our sublinear-time algorithms run, on average, about 35…”
Získať plný text

Sublinear-time algorithms for monomer–dimer systems on bounded degree graphs Autor Lelarge, Marc, Zhou, Hang

“…) is the number of matchings of size k in G. We consider graphs of bounded degree and develop a sublinear-time algorithm for estimating log⁡Z(G,λ…”
Získať plný text

Sublinear Time Algorithms for Graph Problems Autor Liu, Sixue

“…Processing massive graphs is becoming a more-and-more essential task in big-data analysis nowadays. Many graph problems require running time linear in the…”
Získať plný text

Linear and sublinear time algorithms for the basis of abelian groups Autor Chen, Li, Fu, Bin

“…It is well known that every finite abelian group G can be represented as a direct product of cyclic groups: G ≅ G 1 × G 2 × ⋯ × G t , where each G i is a…”
Získať plný text

Sublinear-time algorithms for tournament graphs Autor Dantchev, Stefan, Friedetzky, Tom, Nagel, Lars

“…We show that a random walk on a tournament on n vertices finds either a sink or a 3-cycle in expected time , that is, sublinear both in the size of the…”
Získať plný text

Approximating average parameters of graphs Autor 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…”
Získať plný text

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

“… More precisely, we present new sublinear-time algorithms for the attraction force computation of force-directed algorithms…”
Získať plný text

Time-Optimal Sublinear Algorithms for Matching and Vertex Cover Autor 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…”
Získať plný text

Finding cycles and trees in sublinear time Autor 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…”
Získať plný text

Quantum Meets Fine-Grained Complexity: Sublinear Time Quantum Algorithms for String Problems Autor 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…”
Získať plný text

Sublinear time approximation schemes for makespan minimization on parallel machines Autor 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…”
Získať plný text

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

“… In this paper we present sublinear-time algorithms for different variants of the compressive phase retrieval problem which are akin to the variants of the classical compressive sensing problem…”
Získať plný text