國立高雄大學圖資館 |

登入

回首頁

Algorithms for big dataDFG Priority Program 1736 /

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Algorithms for big dataedited by Hannah Bast ... [et al.].
其他題名:	DFG Priority Program 1736 /
其他作者:	Bast, Hannah.
出版者:	Cham :Springer Nature Switzerland :2022.
面頁冊數:	xiv, 285 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer Nature eBook
標題:	Computer algorithms.
電子資源:	https://doi.org/10.1007/978-3-031-21534-6
ISBN:	9783031215346$q(electronic bk.)

Algorithms for big dataDFG Priority Program 1736 /
Algorithms for big dataDFG Priority Program 1736 /[electronic resource] :edited by Hannah Bast ... [et al.]. - Cham :Springer Nature Switzerland :2022. - xiv, 285 p. :ill. (some col.), digital ;24 cm. - Lecture notes in computer science,132010302-9743 ;. - Lecture notes in computer science ;4891..

Algorithms for Large and Complex Networks Algorithms for Large-scale Network Analysis and the NetworKit Toolkit -- Generating Synthetic Graph Data from Random Network Models -- Sampling Efficiency for the Link Assessment Problem -- A Custom Hardware Architecture for the Link Assessment Problem -- Graph-based Methods for Rational Drug Design -- Recent Advances in Practical Data Reduction -- Skeleton-based Clustering by Quasi-Threshold Editing -- The Space Complexity of Undirected Graph Exploration -- Algorithms for Big Data and their Applications Scalable Cryptography -- Distributed Data Streams -- Energy-Efficient Scheduling -- The GENO Software Stack -- Laue Algorithms for Big Data Problems in de Novo Genome Assembly -- Scalable Text Index Construction. Big Data, Scalability, Algorithms, Applications, Graphs, Networks, Parallelism, Distributed, Memory Hierarchy, Algorithm Engineering, Network Analysis, Random Graphs, Graph Clustering, Data Streams, Cryptography, Energy Efficiency, Text Indices.

Open access.

This open access book surveys the progress in addressing selected challenges related to the growth of big data in combination with increasingly complicated hardware. It emerged from a research program established by the German Research Foundation (DFG) as priority program SPP 1736 on Algorithmics for Big Data where researchers from theoretical computer science worked together with application experts in order to tackle problems in domains such as networking, genomics research, and information retrieval. Such domains are unthinkable without substantial hardware and software support, and these systems acquire, process, exchange, and store data at an exponential rate. The chapters of this volume summarize the results of projects realized within the program and survey-related work. This is an open access book.

ISBN: 9783031215346$q(electronic bk.)

Standard No.: 10.1007/978-3-031-21534-6doiSubjects--Topical Terms:

184478
Computer algorithms.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.1

Algorithms for big dataDFG Priority Program 1736 /
LDR:02920nmm a2200349 a 4500 001 634481
003 DE-He213
005 20230117203247.0
006 m d
007 cr nn 008maaau
008 230529s2022 sz s 0 eng d
020 $a 9783031215346$q(electronic bk.)
020 $a 9783031215339$q(paper)
024 7 $a 10.1007/978-3-031-21534-6 $2 doi
035 $a 978-3-031-21534-6
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UKN $2 bicssc
072 7 $a COM075000 $2 bisacsh
072 7 $a UKN $2 thema
082 0 4 $a 005.1 $2 23
090 $a QA76.9.A43 $b A396 2022
245 0 0 $a Algorithms for big data $h [electronic resource] : $b DFG Priority Program 1736 / $c edited by Hannah Bast ... [et al.].
260 $a Cham : $b Springer Nature Switzerland : $b Imprint: Springer, $c 2022.
300 $a xiv, 285 p. : $b ill. (some col.), digital ; $c 24 cm.
490 1 $a Lecture notes in computer science, $x 0302-9743 ; $v 13201
505 0 $a Algorithms for Large and Complex Networks Algorithms for Large-scale Network Analysis and the NetworKit Toolkit -- Generating Synthetic Graph Data from Random Network Models -- Sampling Efficiency for the Link Assessment Problem -- A Custom Hardware Architecture for the Link Assessment Problem -- Graph-based Methods for Rational Drug Design -- Recent Advances in Practical Data Reduction -- Skeleton-based Clustering by Quasi-Threshold Editing -- The Space Complexity of Undirected Graph Exploration -- Algorithms for Big Data and their Applications Scalable Cryptography -- Distributed Data Streams -- Energy-Efficient Scheduling -- The GENO Software Stack -- Laue Algorithms for Big Data Problems in de Novo Genome Assembly -- Scalable Text Index Construction. Big Data, Scalability, Algorithms, Applications, Graphs, Networks, Parallelism, Distributed, Memory Hierarchy, Algorithm Engineering, Network Analysis, Random Graphs, Graph Clustering, Data Streams, Cryptography, Energy Efficiency, Text Indices.
506 $a Open access.
520 $a This open access book surveys the progress in addressing selected challenges related to the growth of big data in combination with increasingly complicated hardware. It emerged from a research program established by the German Research Foundation (DFG) as priority program SPP 1736 on Algorithmics for Big Data where researchers from theoretical computer science worked together with application experts in order to tackle problems in domains such as networking, genomics research, and information retrieval. Such domains are unthinkable without substantial hardware and software support, and these systems acquire, process, exchange, and store data at an exponential rate. The chapters of this volume summarize the results of projects realized within the program and survey-related work. This is an open access book.
650 0 $a Computer algorithms. $3 184478
650 0 $a Big data. $3 609582
650 1 4 $a Computer Communication Networks. $3 218087
650 2 4 $a Data Structures and Information Theory. $3 825714
650 2 4 $a Mathematics of Computing. $3 273710
650 2 4 $a Design and Analysis of Algorithms. $3 913142
700 1 $a Bast, Hannah. $3 940896
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer Nature eBook
830 0 $a Lecture notes in computer science ; $v 4891. $3 383229
856 4 0 $u https://doi.org/10.1007/978-3-031-21534-6
950 $a Computer Science (SpringerNature-11645)