Sublinear Computation Paradigm : Algorithmic Revolution in the Big Data Era / edited by Naoki Katoh, Yuya Higashikawa, Hiro Ito, Atsuki Nagao, Tetsuo Shibuya, Adnan Sljoka, Kazuyuki Tanaka, Yushi Uno.

Format:

Book

Author/Creator:

Katoh, Naoki.

Contributor:

Higashikawa, Yuya.

Ito, Hiro.

Nagao, Atsuki.

Shibuya, Tetsuo.

Sljoka, Adnan.

Tanaka, Kazuyuki.

Uno, Yūshi.

Series:

Computer Science Series

Language:

English

Subjects (All):

Computer science.

Algorithms.

Theory of Computation.

Local Subjects:

Theory of Computation.

Algorithms.

Physical Description:

1 online resource (403 p.)

Edition:

1st ed. 2022.

Place of Publication:

Singapore : Springer Nature Singapore : Imprint: Springer, 2022.

Language Note:

English

Summary:

This open access book gives an overview of cutting-edge work on a new paradigm called the “sublinear computation paradigm,” which was proposed in the large multiyear academic research project “Foundations of Innovative Algorithms for Big Data.” That project ran from October 2014 to March 2020, in Japan. To handle the unprecedented explosion of big data sets in research, industry, and other areas of society, there is an urgent need to develop novel methods and approaches for big data analysis. To meet this need, innovative changes in algorithm theory for big data are being pursued. For example, polynomial-time algorithms have thus far been regarded as “fast,” but if a quadratic-time algorithm is applied to a petabyte-scale or larger big data set, problems are encountered in terms of computational resources or running time. To deal with this critical computational and algorithmic bottleneck, linear, sublinear, and constant time algorithms are required. The sublinear computation paradigm is proposed here in order to support innovation in the big data era. A foundation of innovative algorithms has been created by developing computational procedures, data structures, and modelling techniques for big data. The project is organized into three teams that focus on sublinear algorithms, sublinear data structures, and sublinear modelling. The work has provided high-level academic research results of strong computational and algorithmic interest, which are presented in this book. The book consists of five parts: Part I, which consists of a single chapter on the concept of the sublinear computation paradigm; Parts II, III, and IV review results on sublinear algorithms, sublinear data structures, and sublinear modelling, respectively; Part V presents application results. The information presented here will inspire the researchers who work in the field of modern algorithms.

Contents:

Chapter 1: What is the Sublinear Computation Paradigm?

Chapter 2: Property Testing on Graphs and Games

Chapter 3: Constant-Time Algorithms for Continuous Optimization Problems

Chapter 4: Oracle-based Primal-Dual Algorithms for Packing and Covering Semidefinite Programs

Chapter 5: Almost Linear Time Algorithms for Some Problems on Dynamic Flow Networks

Chapter 6: Sublinear Data Structure

Chapter 7: Compression and Pattern Matching

Chapter 8: Orthogonal Range Search Data Structures

Chapter 9: Enhanced RAM Simulation in Succinct Space

Chapter 10: Review of Sublinear Modeling in Markov Random Fields by Statistical-Mechanical Informatics and Statistical Machine Learning Theory

Chapter 11: Empirical Bayes Method for Boltzmann Machines

Chapter 12: Dynamical analysis of quantum annealing

Chapter 13: Mean-field analysis of Sourlas codes with adiabatic reverse annealing

Chapter 14: Rigidity theory for protein function analysis and structural accuracy validations

Chapter 15: Optimization of Evacuating and Walking Home Routes from Osaka City with Big Road Network Data on Nankai Megathrust Earthquake

Chapter 16: Stream-based Lossless Data Compression.

Notes:

Description based upon print version of record.

ISBN:

981-16-4095-5

OCLC:

1313880904