23 Hits in 3.5 sec

Strongly Sublinear Algorithms for Testing Pattern Freeness [article]

Ilan Newman, Nithin Varma
2021 arXiv   pre-print
We show that for all constants k ∈ℕ, ε∈ (0,1), and permutation π:[k] → [k], there is a one-sided error ε-testing algorithm for π-freeness of functions f:[n] →ℝ that makes Õ(n^o(1)) queries.  ...  Our algorithm is adaptive, while the earlier best upper bound is known to be tight for nonadaptive algorithms.  ...  In particular, it shows that testing π-freeness has quite efficient sublinear algorithms even for relatively large patterns.  ... 
arXiv:2106.04856v3 fatcat:sizzjvpbnffytmlooyr3wg5mjq

Deleting and Testing Forbidden Patterns in Multi-Dimensional Arrays [article]

Omri Ben-Eliezer and Simon Korman and Daniel Reichman
2017 arXiv   pre-print
We focus on the natural local problem of testing pattern freeness: given a large d-dimensional array A and a fixed d-dimensional pattern P over a finite alphabet, we say that A is P-free if it does not  ...  As the amount of data is often huge, it is desirable to obtain sublinear time algorithms, and specifically property testers, to understand local properties of the data.  ...  Acknowledgements We are grateful to Swastik Kopparty for numerous useful comments. We are thankful to Sofya Raskhodnikova for her useful feedback.  ... 
arXiv:1607.03961v3 fatcat:5c4ndybj35farb3gcwadznulvm

Subject index volumes 1–200

1999 Theoretical Computer Science  
processes, 3230 generation, 729 operator, 682 optimization, 729 test pattern generation, 1582, 2672 problem for circuits, 1582 test set, 768, 909 for a language, 653 test sets, 1582, 2231, 3443  ...  -, 545 parallel maps for -, 545 tessellation automata, pattern decomposition for 298 tessellation automaton, connected -, 298 test complexity, 1582 criteria, 3230 equivalences, 3268 equivalent  ... 
doi:10.1016/s0304-3975(98)00319-3 fatcat:s22ud3iiqjht7lfbtc3zctk7zm

A Survey on Data Pricing: from Economics to Data Science [article]

Jian Pei
2020 arXiv   pre-print
We also consider a series of challenges and directions for future work.  ...  Moreover, the sublinear approximation for unweighted kNN classifiers is facilitated by locality sensitive hashing [51] .  ...  to x test among the training examples in S.  ... 
arXiv:2009.04462v2 fatcat:pacfeqmi7rhdxnihcrnvqbfjay

Sublinear Algorithms Dagstuhl Seminar

Artur Czumaj, S Muthukrishnan, Ronitt Rubinfeld, Christian Sohler
Most of the time, it is impossible to use traditional algorithms for this purpose. Even linear time algorithms are typically too slow because they require random access to the input data.  ...  From August 17 to August 22, 2008, the Dagstuhl Seminar 08341 Sublinear Algorithms was held in the International Conference and Research Center (IBFI), Schloss Dagstuhl.  ...  This should be done by a procedure (a lter) that given as input a point x ∈ [n] d outputs the value of g(x), and runs in time that is highly sublinear in n.  ... 

Practical verified computation with streaming interactive proofs

Graham Cormode, Michael Mitzenmacher, Justin Thaler
2012 Proceedings of the 3rd Innovations in Theoretical Computer Science Conference on - ITCS '12  
In these models, a streaming algorithm (modeling a cloud computing user lacking the resources to store the massive input locally) makes a single pass over an adversarially-ordered input, which is also  ...  As the cloud computing paradigm has gained prominence, the need for verifiable computation has grown urgent.  ...  However, the algorithm simulation approach does not allow for both space usage and annotation length to be sublinear in m. We will achieve this for a wide range of problems in Chapter 4.  ... 
doi:10.1145/2090236.2090245 dblp:conf/innovations/CormodeMT12 fatcat:viwtzva5pjaurbs3ef7be2imhi

Foundations of Reversible Computation [chapter]

Bogdan Aman, Gabriel Ciobanu, Robert Glück, Robin Kaarsgaard, Jarkko Kari, Martin Kutrib, Ivan Lanese, Claudio Antares Mezzina, Łukasz Mikulski, Rajagopal Nagarajan, Iain Phillips, G. Michele Pinna (+3 others)
2020 Lecture Notes in Computer Science  
There are efficient algorithms to test one-dimensional cellular automata for reversibility [177] while in higher dimensional cases reversibility is undecidable [88] .  ...  Liveness and safety in this setting correspond to the should-testing [166] and inverse may-testing preorders [50] for the underlying forward calculus, respectively.  ... 
doi:10.1007/978-3-030-47361-7_1 fatcat:3qgnwqrqnvdltkqjbuzfgx7wty

Algorithmic aspects of resource allocation and multiwinner voting: theory and experiments [article]

Andrzej Kaczmarczyk, Technische Universität Berlin, Rolf Niedermeier
Motivated by such settings, we come up with a new model of graph envy-freeness by adapting the classical envy-freeness notion to account for social relations [...]  ...  Exploiting the parameters, we successfully develop efficient algorithms for spe- cific cases of the studied problems.  ...  Because nm ≤ mm and the test for completeness and envy-freeness in a polynomial-time task, we obtain a fixed-parameter algorithm for parameter “number of resources.”  ... 
doi:10.14279/depositonce-12056 fatcat:6jwpyaw33vbthjip3i6pvpyx4i

Linguistic Annotation [chapter]

Martha Palmer, Nianwen Xue
2010 The Handbook of Computational Linguistics and Natural Language Processing  
ACKNOWLEDGMENT We would like to thank the editors for their very useful comments.  ...  Parts of this paper were written while the second author was a research fellow at the Center for the Study of Language and Information, Stanford University.  ...  The information gain criterion is not a good measure for the comparison of multi-valued tests because it strongly prefers tests with a large number of different outcomes, and creates decision trees which  ... 
doi:10.1002/9781444324044.ch10 fatcat:peq2ppl6gnfklh7gtwzbrt5xym

Analysis of complex socio-economical systems

Eszter Bencsné Bokányi
I'm extremely grateful to them for passing on their enthusiasm for data, coding and new technologies.  ...  I'm grateful for the useful comments and remarks and the help in the proofreading of various parts of the manuscript for Dani Kondor, Balázs Lengyel, and Ancsa Hannák.  ...  Log-normality testing for the distribution of the residuals can, therefore, be used for testing whether a certain measure exhibits urban scaling [99] .  ... 
doi:10.15476/elte.2019.054 fatcat:xvnmqjq6ebbbri3tntutgecmm4

On the Trade-offs between Modeling Power and Algorithmic Complexity

Chun Ye
Most of the academic research in our field focuses on developing algorithmic tools for solving various mathematical problems arising from our models.  ...  The second type addresses the dynamics between model complexity and computational tractability in the context of approximation algorithms for some discrete optimization problems.  ...  For the transition probabilities ρ ij and the arrival rates λ i , we test our algorithm on three different settings: 1.  ... 
doi:10.7916/d87w6cdc fatcat:3xasukff2jhjdafbxh3jsrf5yy

Twin-width II: small classes [article]

Édouard Bonnet, Colin Geniet, Eun Jung Kim, Stéphan Thomassé, Rémi Watrigant
2020 arXiv   pre-print
c^n graphs labeled by [n], for some constant c.  ...  We show that if a graph admits a d-contraction sequence, then it also has a linear-arity tree of f(d)-contractions, for some function f.  ...  There are cubic graphs with bounded twin-width but no strongly sublinear (i.e., of size at most n 1−ε for some ε > 0) balanced separators.  ... 
arXiv:2006.09877v1 fatcat:mpvglrf3v5aexagyfpz6vms4ca

Subject Index Volumes 1–200

2001 Discrete Mathematics  
for isomorphism, 1007 of significance, 3029 test set, 2685 for sorting, 2685 testing point, 96 tetrahedral group, 1672 tetrahedron, 2149, 3024, 4114, 5589 manifold, 5589 tetravalent modal algebra  ...  freeness, 2869 threshold graph, 957, 1242, 1459, 1595, 1690, 1824, 3535, 3788, 4221 hypergraph, 1824 matroid, 998, 3787 method, 731 probability, 3005 signed graph, 1854 theorem for matching,  ...  finite index, 2422 subgroup of index six, 3049 two, 2365, 4651 subhypergraph, 642, 3200, 3909, 4456, 5587 sublattice, 1405, 1597, 1794, 4358, 4766, 5913 lattice, 1635 of the hexagonal lattice, 5072 sublinear  ... 
doi:10.1016/s0012-365x(00)00471-4 fatcat:znxg54q6ifgutnhzj3urcw455y

Dagstuhl Reports, Volume 1, Issue 2, February 2011, Complete Issue [article]

PRAM, thus providing a sublinear support for such games.  ...  ., prefix-freeness, factor-freeness, etc, and show that in all cases the problem is NP-complete even for the binary alphabet. The third problem goes one step back.  ...  a 2-approximation algorithm).  ... 
doi:10.4230/dagrep.1.2 fatcat:4kh64xsaare75bozj6ltf67dxe

Constraint satisfaction with infinite domains [article]

Manuel Bodirsky, Humboldt-Universität Zu Berlin, Humboldt-Universität Zu Berlin
This problem is known as the constraint satisfaction problem CSP(Gamma) for the template Gamma and is intensively studied for relational structures Gamma with a finite domain.  ...  Often they have a natural formulation as a homomorphism problem for a fixed relational structure Gamma: Given a structure S with the same relational signature as Gamma, is there a homomorphism from S to  ...  Testing Freeness Conditions We now want to efficiently compute the set of nodes that satisfy the freeness conditions (F1) and (F2) .  ... 
doi:10.18452/15173 fatcat:etv6vnj47zcerk3h4nn3ybftcy
« Previous Showing results 1 — 15 out of 23 results