Years and Authors of Summarized Original Work
-
2010; Saks, Seshadhri
Problem Definition
Consider some massive dataset represented as a function f : D ↦ R, where D is discrete and R is an arbitrary range. This dataset could be as varied as an array of numbers, a graph, a matrix, or a high-dimensional function. Datasets are often useful because they possess some property of interest. An array might be sorted, a graph might be connected, a matrix might be orthogonal, or a function might be convex. These properties are critical to the use of the dataset. Yet, due to unavoidable errors (say, in storing the dataset), these properties might not hold any longer. For example, a sorted array could become unsorted because of roundoff errors.
Can we find a function g : D ↦ R that satisfies the property and is “sufficiently close” to f? Let us formalize this question. Let \(\mathcal{P}\) denote a property, which we define as a subset of functions. We define a distance between functions, \(\mathsf{dis...
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Recommended Reading
Ailon N, Chazelle B, Comandur S, Liu D (2008) Property-preserving data reconstruction. Algorithmica 51(2):160–182
Austin T, Tao T (2010) Testability and repair of hereditary hypergraph properties. Random Struct Algorithms 36(4):373–463
Awasthi P, Jha M, Molinaro M, Raskhodnikova S (2012) Limitations of local filters of lipschitz and monotone functions. In: Workshop on approximation, randomization, and combinatorial optimization. Algorithms and techniques (RANDOM-APPROX), pp 374–386
Benjamini I, Schramm O, Shapira A (2010) Every minor-closed property of sparse graphs is testable. Adv Math 223(6):2200–2218
Bhattacharyya A, Grigorescu E, Jha M, Jung K, Raskhodnikova S, Woodruff D (2012) Lower bounds for local monotonicity reconstruction from transitive-closure spanners. SIAM J Discret Math 26(2):618–646
Brakerski Z (2008) Local property restoring. Manuscript
Campagna A, Guo A, Rubinfeld R (2013) Local reconstructors and tolerant testers for connectivity and diameter. In: Workshop on approximation, randomization, and combinatorial optimization. Algorithms and techniques (RANDOM-APPROX), pp 411–424
Chazelle B, Seshadhri C (2011) Online geometric reconstruction. J ACM 58(4):14
Jha M, Raskhodnikova S (2013) Testing and reconstruction of lipschitz functions with applications to data privacy. SIAM J Comput 42(2):700–731
Kale S, Seshadhri C (2011) Testing expansion in bounded degree graphs. SIAM J Comput 40(3):709–720
Parnas M, Ron D, Rubinfeld R (2006) Tolerant property testing and distance approximation. J Comput Syst Sci 6(72):1012–1042
Rubinfeld R, Tamir G, Vardi S, Xie N (2011) Fast local computation algorithms. In: Proceedings of innovations in computer science, pp 223–238
Saks M, Seshadhri C (2006) Local monotonicity reconstruction. SIAM J Comput 39(7):2897–2926
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer Science+Business Media New York
About this entry
Cite this entry
Seshadhri, C. (2016). Local Reconstruction. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_698
Download citation
DOI: https://doi.org/10.1007/978-1-4939-2864-4_698
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4939-2863-7
Online ISBN: 978-1-4939-2864-4
eBook Packages: Computer ScienceReference Module Computer Science and Engineering