Suchergebnisse - "Sublinear Algorithms"

A characterization of testable hypergraph properties von Joos, Felix, Kim, Jaehoon, Kühn, Daniela, Osthus, Deryk

“… We provide a combinatorial characterization of all testable properties of k-uniform hypergraphs (k-graphs for short). Here, a k-graph property P is testable if …”
Volltext

Approximating the distance to monotonicity of Boolean functions von Pallavoor, Ramesh Krishnan S., Raskhodnikova, Sofya, Waingarten, Erik

“… We design a nonadaptive algorithm that, given oracle access to a function f:{0,1} n→{0,1} which is α‐far from monotone, makes poly(n,1/α) queries and returns …”
Volltext

Estimating Renyi Entropy of Discrete Distributions von Acharya, Jayadev, Orlitsky, Alon, Suresh, Ananda Theertha, Tyagi, Himanshu

“… It was shown recently that estimating the Shannon entropy H(p) of a discrete k-symbol distribution p requires Θ(k/log k) samples, a number that grows …”
Volltext

Edit Distance in Near-Linear Time: it's a Constant Factor von Andoni, Alexandr, Nosatzki, Negev Shekel

“… We present an algorithm for approximating the edit distance between two strings of length n in time n^{1+\epsilon} , for any \epsilon > 0 , up to a constant …”
Volltext

Sublinear Time Eigenvalue Approximation via Random Sampling von Bhattacharjee, Rajarshi, Dexter, Gregory, Drineas, Petros, Musco, Cameron, Ray, Archan

“… We study the problem of approximating the eigenspectrum of a symmetric matrix A ∈ R n × n with bounded entries (i.e., ‖ A ‖ ∞ ≤ 1 ). We present a simple …”
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

Fast-Match: Fast Affine Template Matching von Korman, Simon, Reichman, Daniel, Tsur, Gilad, Avidan, Shai

“… Fast-Match is a fast algorithm for approximate template matching under 2D affine transformations that minimizes the Sum-of-Absolute-Differences (SAD) error …”
Volltext

New techniques and tighter bounds for local computation algorithms von Reingold, Omer, Vardi, Shai

“… Given an input x and a search problem F, local computation algorithms (LCAs) implement access to specified locations of y in a legal output y∈F(x), using …”
Volltext

Local Computation of Maximal Independent Set von Ghaffari, Mohsen

“… We present a randomized Local Computation Algorithm (LCA) with query complexity poly (\Delta) \cdot \log n for the Maximal Independent Set (MIS) problem. That …”
Volltext

Sublinear Algorithms in T-Interval Dynamic Networks von Jahja, Irvan, Yu, Haifeng

“… We consider standard T - interval dynamic networks , under the synchronous timing model and the broadcast CONGEST model. In a T - interval dynamic network , …”
Volltext

Testing Connectedness of Images von Berman, Piotr, Murzabulatov, Meiram, Raskhodnikova, Sofya, Ristache, Dragos-Florian

“… We investigate algorithms for testing whether an image is connected. Given a proximity parameter ϵ ∈ ( 0 , 1 ) and query access to a black-and-white image …”
Volltext

Improved Streaming Algorithms for Maximum Directed Cut via Smoothed Snapshots von Saxena, Raghuvansh R., Singer, Noah G., Sudan, Madhu, Velusamy, Santhoshini

“… We give an \widetilde{O}(\sqrt{n})-space single-pass 0.483-approximation streaming algorithm for estimating the maximum directed cut size (Max-DICUT) in a …”
Volltext

Tolerant property testing and distance approximation von Parnas, Michal, Ron, Dana, Rubinfeld, Ronitt

“… In this paper we study a generalization of standard property testing where the algorithms are required to be more tolerant with respect to objects that do not …”
Volltext

BBK (Branch and Bound Over K): A Provable and Efficient Ensemble-Based Protein Design Algorithm to Optimize Stability and Binding Affinity Over Large Sequence Spaces von Ojewole, Adegoke A, Jou, Jonathan D, Fowler, Vance G, Donald, Bruce R

“… Computational protein design (CPD) algorithms that compute binding affinity, K , search for sequences with an energetically favorable free energy of binding …”
Weitere Angaben

Query lower bounds for log-concave sampling von Chewi, Sinho, De Dios Pont, Jaume, Li, Jerry, Lu, Chen, Narayanan, Shyam

“… Log-concave sampling has witnessed remarkable algorithmic advances in recent years, but the corresponding problem of proving \ltbold\gtlower bounds\lt/bold\gt …”
Volltext

Sublinear-Time Algorithms for Computing & Embedding Gap Edit Distance von 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. For the …”
Volltext

New Lower Bounds for Adaptive Tolerant Junta Testing von Chen, Xi, Patel, Shyamal

“… We prove a k^{-\Omega\left(\log \left(\varepsilon_{2}-\varepsilon_{1}\right)\right)} lower bound for adap- tively testing whether a Boolean function is …”
Volltext

Streaming Euclidean k-median and k-means with o(log n) Space von Cohen-Addad, Vincent, Woodruff, David P., Zhou, Samson

“… We consider the classic Euclidean k-median and k-means objective on data streams, where the goal is to provide a (1+\varepsilon)-approximation to the optimal …”
Volltext

Streaming Facility Location in High Dimension via Geometric Hashing von Czumaj, Artur, Jiang, Shaofeng H.-C., Krauthgamer, Robert, Vesely, Pavel, Yang, Mingwei

“… In Euclidean Uniform Facility Location, the input is a set of clients in \mathrm{R}^{d} and the goal is to place facilities to serve them, so as to minimize …”
Volltext

Local Algorithms for Sparse Spanning Graphs von Levi, Reut, Ron, Dana, Rubinfeld, Ronitt

“… Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. We consider a relaxed version of this problem in the setting of local …”
Volltext