|
|
|
|
LEADER |
00000cam a2200000 i 4500 |
001 |
OR_on1261367005 |
003 |
OCoLC |
005 |
20231017213018.0 |
006 |
m o d |
007 |
cr cnu---unuuu |
008 |
210724s2021 nyu o 000 0 eng d |
040 |
|
|
|a EBLCP
|b eng
|e rda
|e pn
|c EBLCP
|d YDXIT
|d N$T
|d OCLCO
|d OCLCF
|d TOH
|d YDX
|d OCLCQ
|d AAA
|d OCLCO
|d OCLCQ
|
020 |
|
|
|a 1638350221
|q (electronic book)
|
020 |
|
|
|a 9781638350224
|q (electronic bk.)
|
029 |
1 |
|
|a AU@
|b 000069849282
|
035 |
|
|
|a (OCoLC)1261367005
|
050 |
|
4 |
|a QA76.9.A4
|b L37 2021
|
082 |
0 |
4 |
|a 005.13
|2 23
|
049 |
|
|
|a UAMI
|
100 |
1 |
|
|a La Rocca, Marcello.
|
245 |
1 |
0 |
|a Advanced Algorithms and Data Structures /
|c Marcello La Rocca.
|
264 |
|
1 |
|a Shelter Island, NY :
|b Manning Publications,
|c [2021]
|
300 |
|
|
|a 1 online resource (735 pages)
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
588 |
0 |
|
|a Online resource; title from digital title page (viewed on August 16, 2021).
|
520 |
|
|
|a Advanced Algorithms and Data Structures introduces a collection of algorithms for complex programming challenges in data analysis, machine learning, and graph computing. You'll discover cutting-edge approaches to a variety of tricky scenarios. You'll even learn to design your own data structures for projects that require a custom solution.
|
505 |
0 |
|
|a 1 Introducing data structures -- Part 1. Improving over basic data structures -- 2 Improving priority queues: d-way heaps -- 3 Treaps: Using randomization to balance binary search trees -- 4 Bloom filters: Reducing the memory for tracking content -- 5 Disjoint sets: Sub-linear time processing -- 6 Trie, radix trie: Efficient string search -- 7 Use case: LRU cache -- Part 2. Multidimensional queries -- 8 Nearest neighbors search -- 9 K-d trees: Multidimensional data indexing -- 10 Similarity Search Trees: Approximate nearest neighbors search for image retrieval -- 11 Applications of nearest neighbor search -- 12 Clustering -- 13 Parallel clustering: MapReduce and canopy clustering -- Part 3. Planar graphs and minimum crossing number -- 14 An introduction to graphs: Finding paths of minimum distance -- 15 Graph embeddings and planarity: Drawing graphs with minimal edge intersections -- 16 Gradient descent: Optimization problems (not just) on graphs -- 17 Simulated annealing: Optimization beyond local minima -- 18 Genetic algorithms: Biologically inspired, fast-converging optimization -- Appendix A. A quick guide to pseudo-code -- Appendix B. Big-O notation -- Appendix C. Core data structures -- Appendix D. Containers as priority queues -- Appendix E. Recursion -- Appendix F. Classification problems and randomnized algorithm metrics -- Index.
|
590 |
|
|
|a O'Reilly
|b O'Reilly Online Learning: Academic/Public Library Edition
|
650 |
|
0 |
|a Computer algorithms.
|
650 |
|
2 |
|a Algorithms
|
650 |
|
6 |
|a Algorithmes.
|
650 |
|
7 |
|a algorithms.
|2 aat
|
650 |
|
7 |
|a Computer algorithms.
|2 fast
|0 (OCoLC)fst00872010
|
776 |
0 |
8 |
|i Print version:
|a La Rocca, Marcello.
|t Advanced Algorithms and Data Structures.
|d New York : Manning Publications Co. LLC, ©2021
|z 9781617295485
|
856 |
4 |
0 |
|u https://learning.oreilly.com/library/view/~/9781617295485/?ar
|z Texto completo (Requiere registro previo con correo institucional)
|
938 |
|
|
|a ProQuest Ebook Central
|b EBLB
|n EBL6676887
|
938 |
|
|
|a EBSCOhost
|b EBSC
|n 2959469
|
938 |
|
|
|a YBP Library Services
|b YANK
|n 302330575
|
994 |
|
|
|a 92
|b IZTAP
|