Abstract
This book is divided into two parts: the foundation part (Chap. 2) and the application part (Chaps. 3–5). In Sect. 2.3.1, we start from an easy application of inequalities to derive a very first bound. We then study finding distinct elements in Sect. 2.3.2 We show an insight to solve the problem and how to analyze the insight. In Sect. 2.3.3, we present a two cat problem and we develop an algorithm that is sublinear, yet differs from the traditional (1 +ε, δ) sublinear algorithm format. We then look into three applications of sublinear algorithms on wireless sensor networks, big data processing, and smart grids in Chaps. 3–5.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsAuthor information
Authors and Affiliations
Rights and permissions
Copyright information
© 2015 The Author(s)
About this chapter
Cite this chapter
Wang, D., Han, Z. (2015). Concluding Remarks. In: Sublinear Algorithms for Big Data Applications. SpringerBriefs in Computer Science. Springer, Cham. https://doi.org/10.1007/978-3-319-20448-2_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-20448-2_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-20447-5
Online ISBN: 978-3-319-20448-2
eBook Packages: Computer ScienceComputer Science (R0)