Algorithms:
"This book is an introduction to algorithms targeting an audience with little to no computer science background. In this book, algorithms from a wide area are presented: from music to searching and sorting, to deep learning, to graphs. The author shows how algorithms are used in practice. A uni...
Gespeichert in:
Beteilige Person: | |
---|---|
Format: | Buch |
Sprache: | Englisch |
Veröffentlicht: |
Cambridge, Massachusetts
The MIT Press
[2020]
|
Schriftenreihe: | The MIT Press essential knowledge series
|
Schlagwörter: | |
Zusammenfassung: | "This book is an introduction to algorithms targeting an audience with little to no computer science background. In this book, algorithms from a wide area are presented: from music to searching and sorting, to deep learning, to graphs. The author shows how algorithms are used in practice. A unique feature of the book is that it focuses on showing how algorithms really work; not just what algorithms can do. There are many books discussing that and delving in technological applications and their implications. The book aims to show not just what algorithms can do, but how they do it. Louridas covers a wide range of algorithms. He does not shy away from classic algorithms such as searching and sorting, as they are the workhorses of most applications; at the same time, he also covers a wide expanse, such as algorithms in music, non-traditional searching (like the secretary problem), graphs, and the PageRank algorithm. He introduces deep learning, showing how it works in practice, and gives an overview of the limits of computability. He finishes up the text with an eclectic discussion of implications. Most books on algorithms are either too technical, or not technical at all - showing what the algorithms do, without showing how. This book aims at striking a balance between the two methods. Algorithms should be, and can be explained, in simple terms. To repeat, an algorithm should be explained so that a human can execute it with a pen and paper"-- |
Beschreibung: | Enthält: Literaturangaben |
Umfang: | xxi, 280 Seiten |
ISBN: | 9780262539029 |
Internformat
MARC
LEADER | 00000nam a2200000 c 4500 | ||
---|---|---|---|
001 | BV046657915 | ||
003 | DE-604 | ||
005 | 20210629 | ||
007 | t| | ||
008 | 200406s2020 xx b||| 00||| eng d | ||
010 | |a 2019040771 | ||
020 | |a 9780262539029 |c (paperback) |9 978-0-262-53902-9 | ||
035 | |a (OCoLC)1150858965 | ||
035 | |a (DE-599)OBVAC15622092 | ||
040 | |a DE-604 |b ger |e rda | ||
041 | 0 | |a eng | |
049 | |a DE-525 |a DE-83 |a DE-706 |a DE-20 | ||
082 | 0 | |a 005.13 |2 23 | |
084 | |a ST 134 |0 (DE-625)143590: |2 rvk | ||
100 | 1 | |a Louridas, Panos |e Verfasser |4 aut | |
245 | 1 | 0 | |a Algorithms |c Panos Louridas |
264 | 1 | |a Cambridge, Massachusetts |b The MIT Press |c [2020] | |
264 | 4 | |c © 2020 | |
300 | |a xxi, 280 Seiten | ||
336 | |b txt |2 rdacontent | ||
337 | |b n |2 rdamedia | ||
338 | |b nc |2 rdacarrier | ||
490 | 0 | |a The MIT Press essential knowledge series | |
500 | |a Enthält: Literaturangaben | ||
520 | |a "This book is an introduction to algorithms targeting an audience with little to no computer science background. In this book, algorithms from a wide area are presented: from music to searching and sorting, to deep learning, to graphs. The author shows how algorithms are used in practice. A unique feature of the book is that it focuses on showing how algorithms really work; not just what algorithms can do. There are many books discussing that and delving in technological applications and their implications. The book aims to show not just what algorithms can do, but how they do it. Louridas covers a wide range of algorithms. He does not shy away from classic algorithms such as searching and sorting, as they are the workhorses of most applications; at the same time, he also covers a wide expanse, such as algorithms in music, non-traditional searching (like the secretary problem), graphs, and the PageRank algorithm. He introduces deep learning, showing how it works in practice, and gives an overview of the limits of computability. He finishes up the text with an eclectic discussion of implications. Most books on algorithms are either too technical, or not technical at all - showing what the algorithms do, without showing how. This book aims at striking a balance between the two methods. Algorithms should be, and can be explained, in simple terms. To repeat, an algorithm should be explained so that a human can execute it with a pen and paper"-- | ||
650 | 4 | |a 01g |v Popular works | |
650 | 4 | |a Computer algorithms |v Popular works | |
650 | 0 | 7 | |a Informatik |0 (DE-588)4026894-9 |2 gnd |9 rswk-swf |
650 | 0 | 7 | |a Algorithmus |0 (DE-588)4001183-5 |2 gnd |9 rswk-swf |
689 | 0 | 0 | |a Algorithmus |0 (DE-588)4001183-5 |D s |
689 | 0 | 1 | |a Informatik |0 (DE-588)4026894-9 |D s |
689 | 0 | |5 DE-604 | |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-0-262-35866-8 |
776 | 0 | 8 | |i Erscheint auch als |n Online-Ausgabe |z 978-0-262-35867-5 |
943 | 1 | |a oai:aleph.bib-bvb.de:BVB01-032069050 |
Datensatz im Suchindex
_version_ | 1818986861973995520 |
---|---|
any_adam_object | |
author | Louridas, Panos |
author_facet | Louridas, Panos |
author_role | aut |
author_sort | Louridas, Panos |
author_variant | p l pl |
building | Verbundindex |
bvnumber | BV046657915 |
classification_rvk | ST 134 |
ctrlnum | (OCoLC)1150858965 (DE-599)OBVAC15622092 |
dewey-full | 005.13 |
dewey-hundreds | 000 - Computer science, information, general works |
dewey-ones | 005 - Computer programming, programs, data, security |
dewey-raw | 005.13 |
dewey-search | 005.13 |
dewey-sort | 15.13 |
dewey-tens | 000 - Computer science, information, general works |
discipline | Informatik |
format | Book |
fullrecord | <?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>02904nam a2200445 c 4500</leader><controlfield tag="001">BV046657915</controlfield><controlfield tag="003">DE-604</controlfield><controlfield tag="005">20210629 </controlfield><controlfield tag="007">t|</controlfield><controlfield tag="008">200406s2020 xx b||| 00||| eng d</controlfield><datafield tag="010" ind1=" " ind2=" "><subfield code="a">2019040771</subfield></datafield><datafield tag="020" ind1=" " ind2=" "><subfield code="a">9780262539029</subfield><subfield code="c">(paperback)</subfield><subfield code="9">978-0-262-53902-9</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(OCoLC)1150858965</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)OBVAC15622092</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-604</subfield><subfield code="b">ger</subfield><subfield code="e">rda</subfield></datafield><datafield tag="041" ind1="0" ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="049" ind1=" " ind2=" "><subfield code="a">DE-525</subfield><subfield code="a">DE-83</subfield><subfield code="a">DE-706</subfield><subfield code="a">DE-20</subfield></datafield><datafield tag="082" ind1="0" ind2=" "><subfield code="a">005.13</subfield><subfield code="2">23</subfield></datafield><datafield tag="084" ind1=" " ind2=" "><subfield code="a">ST 134</subfield><subfield code="0">(DE-625)143590:</subfield><subfield code="2">rvk</subfield></datafield><datafield tag="100" ind1="1" ind2=" "><subfield code="a">Louridas, Panos</subfield><subfield code="e">Verfasser</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="0"><subfield code="a">Algorithms</subfield><subfield code="c">Panos Louridas</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="a">Cambridge, Massachusetts</subfield><subfield code="b">The MIT Press</subfield><subfield code="c">[2020]</subfield></datafield><datafield tag="264" ind1=" " ind2="4"><subfield code="c">© 2020</subfield></datafield><datafield tag="300" ind1=" " ind2=" "><subfield code="a">xxi, 280 Seiten</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="b">n</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="b">nc</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="490" ind1="0" ind2=" "><subfield code="a">The MIT Press essential knowledge series</subfield></datafield><datafield tag="500" ind1=" " ind2=" "><subfield code="a">Enthält: Literaturangaben</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">"This book is an introduction to algorithms targeting an audience with little to no computer science background. In this book, algorithms from a wide area are presented: from music to searching and sorting, to deep learning, to graphs. The author shows how algorithms are used in practice. A unique feature of the book is that it focuses on showing how algorithms really work; not just what algorithms can do. There are many books discussing that and delving in technological applications and their implications. The book aims to show not just what algorithms can do, but how they do it. Louridas covers a wide range of algorithms. He does not shy away from classic algorithms such as searching and sorting, as they are the workhorses of most applications; at the same time, he also covers a wide expanse, such as algorithms in music, non-traditional searching (like the secretary problem), graphs, and the PageRank algorithm. He introduces deep learning, showing how it works in practice, and gives an overview of the limits of computability. He finishes up the text with an eclectic discussion of implications. Most books on algorithms are either too technical, or not technical at all - showing what the algorithms do, without showing how. This book aims at striking a balance between the two methods. Algorithms should be, and can be explained, in simple terms. To repeat, an algorithm should be explained so that a human can execute it with a pen and paper"--</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">01g</subfield><subfield code="v">Popular works</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Computer algorithms</subfield><subfield code="v">Popular works</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="650" ind1="0" ind2="7"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="2">gnd</subfield><subfield code="9">rswk-swf</subfield></datafield><datafield tag="689" ind1="0" ind2="0"><subfield code="a">Algorithmus</subfield><subfield code="0">(DE-588)4001183-5</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2="1"><subfield code="a">Informatik</subfield><subfield code="0">(DE-588)4026894-9</subfield><subfield code="D">s</subfield></datafield><datafield tag="689" ind1="0" ind2=" "><subfield code="5">DE-604</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-0-262-35866-8</subfield></datafield><datafield tag="776" ind1="0" ind2="8"><subfield code="i">Erscheint auch als</subfield><subfield code="n">Online-Ausgabe</subfield><subfield code="z">978-0-262-35867-5</subfield></datafield><datafield tag="943" ind1="1" ind2=" "><subfield code="a">oai:aleph.bib-bvb.de:BVB01-032069050</subfield></datafield></record></collection> |
id | DE-604.BV046657915 |
illustrated | Not Illustrated |
indexdate | 2024-12-20T18:57:32Z |
institution | BVB |
isbn | 9780262539029 |
language | English |
lccn | 2019040771 |
oai_aleph_id | oai:aleph.bib-bvb.de:BVB01-032069050 |
oclc_num | 1150858965 |
open_access_boolean | |
owner | DE-525 DE-83 DE-706 DE-20 |
owner_facet | DE-525 DE-83 DE-706 DE-20 |
physical | xxi, 280 Seiten |
publishDate | 2020 |
publishDateSearch | 2020 |
publishDateSort | 2020 |
publisher | The MIT Press |
record_format | marc |
series2 | The MIT Press essential knowledge series |
spelling | Louridas, Panos Verfasser aut Algorithms Panos Louridas Cambridge, Massachusetts The MIT Press [2020] © 2020 xxi, 280 Seiten txt rdacontent n rdamedia nc rdacarrier The MIT Press essential knowledge series Enthält: Literaturangaben "This book is an introduction to algorithms targeting an audience with little to no computer science background. In this book, algorithms from a wide area are presented: from music to searching and sorting, to deep learning, to graphs. The author shows how algorithms are used in practice. A unique feature of the book is that it focuses on showing how algorithms really work; not just what algorithms can do. There are many books discussing that and delving in technological applications and their implications. The book aims to show not just what algorithms can do, but how they do it. Louridas covers a wide range of algorithms. He does not shy away from classic algorithms such as searching and sorting, as they are the workhorses of most applications; at the same time, he also covers a wide expanse, such as algorithms in music, non-traditional searching (like the secretary problem), graphs, and the PageRank algorithm. He introduces deep learning, showing how it works in practice, and gives an overview of the limits of computability. He finishes up the text with an eclectic discussion of implications. Most books on algorithms are either too technical, or not technical at all - showing what the algorithms do, without showing how. This book aims at striking a balance between the two methods. Algorithms should be, and can be explained, in simple terms. To repeat, an algorithm should be explained so that a human can execute it with a pen and paper"-- 01g Popular works Computer algorithms Popular works Informatik (DE-588)4026894-9 gnd rswk-swf Algorithmus (DE-588)4001183-5 gnd rswk-swf Algorithmus (DE-588)4001183-5 s Informatik (DE-588)4026894-9 s DE-604 Erscheint auch als Online-Ausgabe 978-0-262-35866-8 Erscheint auch als Online-Ausgabe 978-0-262-35867-5 |
spellingShingle | Louridas, Panos Algorithms 01g Popular works Computer algorithms Popular works Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd |
subject_GND | (DE-588)4026894-9 (DE-588)4001183-5 |
title | Algorithms |
title_auth | Algorithms |
title_exact_search | Algorithms |
title_full | Algorithms Panos Louridas |
title_fullStr | Algorithms Panos Louridas |
title_full_unstemmed | Algorithms Panos Louridas |
title_short | Algorithms |
title_sort | algorithms |
topic | 01g Popular works Computer algorithms Popular works Informatik (DE-588)4026894-9 gnd Algorithmus (DE-588)4001183-5 gnd |
topic_facet | 01g Popular works Computer algorithms Popular works Informatik Algorithmus |
work_keys_str_mv | AT louridaspanos algorithms |