東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

Sublinear computation paradigm = alg...

Katoh, Naoki.

FindBook

Google Book

Amazon

博客來

Sublinear computation paradigm = algorithmic revolution in the big data era /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Sublinear computation paradigm/ edited by Naoki Katoh ... [et al.].
其他題名:	algorithmic revolution in the big data era /
其他作者:	Katoh, Naoki.
出版者:	Singapore :Springer Singapore : : 2022.,
面頁冊數:	viii, 410 p. :ill. (some col.), digital ;24 cm.
內容註:	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.
Contained By:	Springer Nature eBook
標題:	Computer algorithms - Mathematics. -
電子資源:	https://doi.org/10.1007/978-981-16-4095-7
ISBN:	9789811640957

Sublinear computation paradigm = algorithmic revolution in the big data era /
Sublinear computation paradigmalgorithmic revolution in the big data era /[electronic resource] :edited by Naoki Katoh ... [et al.]. - Singapore :Springer Singapore :2022. - viii, 410 p. :ill. (some col.), digital ;24 cm.

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.

Open access.

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.

ISBN: 9789811640957

Standard No.: 10.1007/978-981-16-4095-7doiSubjects--Topical Terms:

3589680
Computer algorithms
--Mathematics.

LC Class. No.: QA76.9.A43 / S83 2022

Dewey Class. No.: 005.10151

Sublinear computation paradigm = algorithmic revolution in the big data era /
LDR:04158nmm a2200337 a 4500 001 2295647
003 DE-He213
005 20211019124853.0
006 m d
007 cr nn 008maaau
008 230324s2022 si s 0 eng d
020 $a 9789811640957 $q (electronic bk.)
020 $a 9789811640940 $q (paper)
024 7 $a 10.1007/978-981-16-4095-7 $2 doi
035 $a 978-981-16-4095-7
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43 $b S83 2022
072 7 $a UMB $2 bicssc
072 7 $a COM051300 $2 bisacsh
072 7 $a UMB $2 thema
082 0 4 $a 005.10151 $2 23
090 $a QA76.9.A43 $b S941 2022
245 0 0 $a Sublinear computation paradigm $h [electronic resource] : $b algorithmic revolution in the big data era / $c edited by Naoki Katoh ... [et al.].
260 $a Singapore : $b Springer Singapore : $b Imprint: Springer, $c 2022.
300 $a viii, 410 p. : $b ill. (some col.), digital ; $c 24 cm.
505 0 $a 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.
506 $a Open access.
520 $a 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.
650 0 $a Computer algorithms $x Mathematics. $3 3589680
650 0 $a Big data. $3 2045508
650 1 4 $a Algorithm Analysis and Problem Complexity. $3 891007
650 2 4 $a Algorithms. $3 536374
700 1 $a Katoh, Naoki. $3 849494
710 2 $a SpringerLink (Online service) $3 836513
773 0 $t Springer Nature eBook
856 4 0 $u https://doi.org/10.1007/978-981-16-4095-7
950 $a Computer Science (SpringerNature-11645)