國立高雄大學圖資館 |

Encyclopedia of algorithms

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Encyclopedia of algorithmsedited by Ming-Yang Kao.
其他作者:	Kao, Ming-Yang.
出版者:	New York, NY :Springer New York :2016.
面頁冊數:	liii, 1166 p. :ill. (some col.), digital ;24 cm.
Contained By:	Springer eBooks
標題:	Computer algorithmsCongresses.
電子資源:	http://dx.doi.org/10.1007/978-1-4939-2864-4
ISBN:	9781493928644$q(electronic bk.)

Encyclopedia of algorithms
Encyclopedia of algorithms[electronic resource] /edited by Ming-Yang Kao. - 2nd ed. - New York, NY :Springer New York :2016. - liii, 1166 p. :ill. (some col.), digital ;24 cm.

From the contents: Abelian Hidden Subgroup Problem -- Abstract Voronoi Diagrams -- Active Learning - Modern Learning Theory -- Backdoors to SAT -- Backtracking Based k-SAT Algorithms -- Bargaining Networks -- Cache-Oblivious B-Tree -- Canonical Orders and Schnyder Realizers -- Circuit Placement -- Data Migration -- Decoding Reed-Solomon Codes -- Direct Routing Algorithms -- Edit Distance Under Block Operations -- Engineering Geometric Algorithms -- Enumeration of Non-crossing Geometric Graphs -- Facility Location -- Flow Time Minimization -- Force-Directed Graph Drawing -- Gate Sizing -- General Equilibrium -- Geographic Routing -- Hamilton Cycles in Random Intersection Graphs -- Hardness of Proper Learning -- Huffman Coding -- Implementation Challenge for Shortest Paths -- Incentive Compatible Selection -- Inductive Inference -- Kernelization, Bidimensionality and Kernels -- Kinetic Data Structures -- Knowledge in Distributed Systems -- Large-Treewidth Graph Decompositions -- Layout Decomposition for Multiple Patterning -- Learning Automata -- Majority Equilibrium -- Manifold Reconstruction -- Market Games and Content Distribution -- Nash Equilibria and Dominant Strategies in Routing -- Nearest Neighbor Interchange and Related Distances -- Negative Cycles in Weighted Digraphs -- Oblivious Routing -- Online Interval Coloring -- Online Paging and Caching -- PAC Learning -- Parity Games -- Permutation Enumeration -- Quadtrees and Morton Indexing -- Quantum Algorithm for Factoring -- Quantum Dense Coding -- Radiocoloring in Planar Graphs -- Random Planted 3-SAT -- Randomization in Distributed Computing -- Schedulers for Optimistic Rate Based Flow Control -- Secretary Problems and Online Auctions -- Separators in Graphs -- Table Compression -- Text Indexing -- Triangulation Data Structures -- Unified View of Graph Searching and LDFS-Based Certifying Algorithms -- Universal Sequencing on an Unreliable Machine -- Upward Graph Drawing -- Vector Bin Packing -- Vector Scheduling Problems -- Voltage Scheduling -- Wavelet Trees -- Well Separated Pair Decomposition -- Wire Sizing.

This dynamic reference work provides solutions to vital algorithmic problems for scholars, researchers, practitioners, teachers and students in fields such as computer science, mathematics, statistics, biology, economics, financial software, and medical informatics. This second edition is broadly expanded, building upon the success of its former edition with more than 450 new and updated entries. These entries are designed to ensure algorithms are presented from growing areas of research such as bioinformatics, combinatorial group testing, differential privacy, enumeration algorithms, game theory, massive data algorithms, modern learning theory, social networks, and VLSI CAD algorithms. Over 630 entries are organized alphabetically by problem, with subentries allowing for distinct solutions. Each entry includes a description of the basic algorithmic problem; the input and output specifications; key results; examples of applications; citations to key literature, open problems, experimental results, links to data sets and downloadable code. All entries are peer-reviewed, written by leading experts in the field--and each entry contains links to a summary of the author's research work. This defining reference is available in both print and online--a dynamic living work with hyperlinks to related entries, cross references citations, and a myriad other valuable URLs. New and Updated entries include: Algorithmic Aspects of Distributed Sensor Networks, Algorithms for Modern Computers Bioinformatics Certified Reconstruction and Mesh Generation Combinatorial Group Testing Compression of Text and Data Structures Computational Counting Computational Economics Computational Geometry Differential Privacy Enumeration Algorithms Exact Exponential Algorithms Game Theory Graph Drawing Group Testing Internet Algorithms Kernels and Compressions Massive Data Algorithms Mathematical Optimization Modern Learning Theory Social Networks Stable Marriage Problems, k-SAT Algorithms Sublinear Algorithms Tile Self-Assembly VLSI CAD Algorithms.

ISBN: 9781493928644$q(electronic bk.)

Standard No.: 10.1007/978-1-4939-2864-4doiSubjects--Topical Terms:

380777
Computer algorithms
--Congresses.

LC Class. No.: QA76.9.A43

Dewey Class. No.: 005.103

Encyclopedia of algorithms
LDR:05170nmm a2200349 a 4500 001 486484
003 DE-He213
005 20161003155627.0
006 m d
007 cr nn 008maaau
008 161116s2016 nyu s 0 eng d
020 $a 9781493928644$q(electronic bk.)
020 $a 9781493928637$q(paper)
024 7 $a 10.1007/978-1-4939-2864-4 $2 doi
035 $a 978-1-4939-2864-4
040 $a GP $c GP
041 0 $a eng
050 4 $a QA76.9.A43
072 7 $a UY $2 bicssc
072 7 $a UYA $2 bicssc
072 7 $a COM014000 $2 bisacsh
072 7 $a COM031000 $2 bisacsh
082 0 4 $a 005.103 $2 23
090 $a QA76.9.A43 $b E56 2016
245 0 0 $a Encyclopedia of algorithms $h [electronic resource] / $c edited by Ming-Yang Kao.
250 $a 2nd ed.
260 $a New York, NY : $b Springer New York : $b Imprint: Springer, $c 2016.
300 $a liii, 1166 p. : $b ill. (some col.), digital ; $c 24 cm.
505 0 $a From the contents: Abelian Hidden Subgroup Problem -- Abstract Voronoi Diagrams -- Active Learning - Modern Learning Theory -- Backdoors to SAT -- Backtracking Based k-SAT Algorithms -- Bargaining Networks -- Cache-Oblivious B-Tree -- Canonical Orders and Schnyder Realizers -- Circuit Placement -- Data Migration -- Decoding Reed-Solomon Codes -- Direct Routing Algorithms -- Edit Distance Under Block Operations -- Engineering Geometric Algorithms -- Enumeration of Non-crossing Geometric Graphs -- Facility Location -- Flow Time Minimization -- Force-Directed Graph Drawing -- Gate Sizing -- General Equilibrium -- Geographic Routing -- Hamilton Cycles in Random Intersection Graphs -- Hardness of Proper Learning -- Huffman Coding -- Implementation Challenge for Shortest Paths -- Incentive Compatible Selection -- Inductive Inference -- Kernelization, Bidimensionality and Kernels -- Kinetic Data Structures -- Knowledge in Distributed Systems -- Large-Treewidth Graph Decompositions -- Layout Decomposition for Multiple Patterning -- Learning Automata -- Majority Equilibrium -- Manifold Reconstruction -- Market Games and Content Distribution -- Nash Equilibria and Dominant Strategies in Routing -- Nearest Neighbor Interchange and Related Distances -- Negative Cycles in Weighted Digraphs -- Oblivious Routing -- Online Interval Coloring -- Online Paging and Caching -- PAC Learning -- Parity Games -- Permutation Enumeration -- Quadtrees and Morton Indexing -- Quantum Algorithm for Factoring -- Quantum Dense Coding -- Radiocoloring in Planar Graphs -- Random Planted 3-SAT -- Randomization in Distributed Computing -- Schedulers for Optimistic Rate Based Flow Control -- Secretary Problems and Online Auctions -- Separators in Graphs -- Table Compression -- Text Indexing -- Triangulation Data Structures -- Unified View of Graph Searching and LDFS-Based Certifying Algorithms -- Universal Sequencing on an Unreliable Machine -- Upward Graph Drawing -- Vector Bin Packing -- Vector Scheduling Problems -- Voltage Scheduling -- Wavelet Trees -- Well Separated Pair Decomposition -- Wire Sizing.
520 $a This dynamic reference work provides solutions to vital algorithmic problems for scholars, researchers, practitioners, teachers and students in fields such as computer science, mathematics, statistics, biology, economics, financial software, and medical informatics. This second edition is broadly expanded, building upon the success of its former edition with more than 450 new and updated entries. These entries are designed to ensure algorithms are presented from growing areas of research such as bioinformatics, combinatorial group testing, differential privacy, enumeration algorithms, game theory, massive data algorithms, modern learning theory, social networks, and VLSI CAD algorithms. Over 630 entries are organized alphabetically by problem, with subentries allowing for distinct solutions. Each entry includes a description of the basic algorithmic problem; the input and output specifications; key results; examples of applications; citations to key literature, open problems, experimental results, links to data sets and downloadable code. All entries are peer-reviewed, written by leading experts in the field--and each entry contains links to a summary of the author's research work. This defining reference is available in both print and online--a dynamic living work with hyperlinks to related entries, cross references citations, and a myriad other valuable URLs. New and Updated entries include: Algorithmic Aspects of Distributed Sensor Networks, Algorithms for Modern Computers Bioinformatics Certified Reconstruction and Mesh Generation Combinatorial Group Testing Compression of Text and Data Structures Computational Counting Computational Economics Computational Geometry Differential Privacy Enumeration Algorithms Exact Exponential Algorithms Game Theory Graph Drawing Group Testing Internet Algorithms Kernels and Compressions Massive Data Algorithms Mathematical Optimization Modern Learning Theory Social Networks Stable Marriage Problems, k-SAT Algorithms Sublinear Algorithms Tile Self-Assembly VLSI CAD Algorithms.
650 0 $a Computer algorithms $v Congresses. $3 380777
650 0 $a Algorithms $3 253943
650 1 4 $a Computer Science. $3 212513
650 2 4 $a Theory of Computation. $3 274475
650 2 4 $a Electrical Engineering. $3 338706
650 2 4 $a Applications of Mathematics. $3 273744
650 2 4 $a Computing Methodologies. $3 274528
650 2 4 $a Computational Mathematics and Numerical Analysis. $3 274020
700 1 $a Kao, Ming-Yang. $3 283989
710 2 $a SpringerLink (Online service) $3 273601
773 0 $t Springer eBooks
856 4 0 $u http://dx.doi.org/10.1007/978-1-4939-2864-4
950 $a Computer Science (Springer-11645)