Angebote zu "Graphs" (88 Treffer)

Kategorien

Shops

Kasneci, Gjergji: Searching and Ranking in Enti...
69,90 € *
ggf. zzgl. Versand

Erscheinungsdatum: 03.11.2015, Medium: Taschenbuch, Einband: Kartoniert / Broschiert, Titel: Searching and Ranking in Entity-Relationship Graphs, Titelzusatz: From Web Pages to Knowledge, Autor: Kasneci, Gjergji, Verlag: Südwestdeutscher Verlag für Hochschulschriften AG Co. KG, Sprache: Englisch, Rubrik: Maschinenbau // Fertigungstechnik, Seiten: 152, Informationen: Paperback, Gewicht: 244 gr, Verkäufer: averdo

Anbieter: averdo
Stand: 05.08.2020
Zum Angebot
Reforgiato Recupero, Diego: ANTIPOLE TREE INDEX...
59,00 € *
ggf. zzgl. Versand

Erscheinungsdatum: 06/2010, Medium: Taschenbuch, Einband: Kartoniert / Broschiert, Titel: ANTIPOLE TREE INDEXING AND GRAPHGREPVF, Titelzusatz: DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS, Autor: Reforgiato Recupero, Diego, Verlag: LAP Lambert Acad. Publ., Sprache: Englisch, Rubrik: Informatik // EDV, Sonstiges, Seiten: 156, Informationen: Paperback, Gewicht: 249 gr, Verkäufer: averdo

Anbieter: averdo
Stand: 05.08.2020
Zum Angebot
Searching Cliques in Graphs
93,90 € *
ggf. zzgl. Versand

Searching Cliques in Graphs ab 93.9 € als Taschenbuch: . Aus dem Bereich: Bücher, English, International, Gebundene Ausgaben,

Anbieter: hugendubel
Stand: 05.08.2020
Zum Angebot
Searching and Ranking in Entity-Relationship Gr...
69,90 € *
ggf. zzgl. Versand

Searching and Ranking in Entity-Relationship Graphs ab 69.9 € als Taschenbuch: From Web Pages to Knowledge. Aus dem Bereich: Bücher, Wissenschaft, Technik,

Anbieter: hugendubel
Stand: 05.08.2020
Zum Angebot
ANTIPOLE TREE INDEXING AND GRAPHGREPVF
59,00 € *
ggf. zzgl. Versand

ANTIPOLE TREE INDEXING AND GRAPHGREPVF ab 59 € als Taschenbuch: DATA STRUCTURES AND ALGORITHMS FOR OPTIMIZATION AND SEARCHING PROBLEMS IN METRIC SPACES AND GRAPHS. Aus dem Bereich: Bücher, English, International, Gebundene Ausgaben,

Anbieter: hugendubel
Stand: 05.08.2020
Zum Angebot
The Art of Concurrency: A Thread Monkey's Guide...
47,20 € *
ggf. zzgl. Versand

If you're looking to take full advantage of multi-core processors with concurrent programming, this practical book provides the knowledge and hands-on experience you need. The Art of Concurrency is one of the few resources to focus on implementing algorithms in the shared-memory model of multi-core processors, rather than just theoretical models or distributed-memory architectures. The book provides detailed explanations and usable samples to help you transform algorithms from serial to parallel code, along with advice and analysis for avoiding mistakes that programmers typically make when first attempting these computations.Written by an Intel engineer with over two decades of parallel and concurrent programming experience, this book will help you:- Understand parallelism and concurrency - Explore differences between programming for shared-memory and distributed-memory - Learn guidelines for designing multithreaded applications, including testing and tuning - Discover how to make best use of different threading libraries, including Windows threads, POSIX threads, OpenMP, and Intel Threading Building Blocks - Explore how to implement concurrent algorithms that involve sorting, searching, graphs, and other practical computationsThe Art of Concurrency shows you how to keep algorithms scalable to take advantage of new processors with even more cores. For developing parallel code algorithms for concurrent programming, this book is a must.

Anbieter: buecher
Stand: 05.08.2020
Zum Angebot
The Art of Concurrency: A Thread Monkey's Guide...
47,20 € *
ggf. zzgl. Versand

If you're looking to take full advantage of multi-core processors with concurrent programming, this practical book provides the knowledge and hands-on experience you need. The Art of Concurrency is one of the few resources to focus on implementing algorithms in the shared-memory model of multi-core processors, rather than just theoretical models or distributed-memory architectures. The book provides detailed explanations and usable samples to help you transform algorithms from serial to parallel code, along with advice and analysis for avoiding mistakes that programmers typically make when first attempting these computations.Written by an Intel engineer with over two decades of parallel and concurrent programming experience, this book will help you:- Understand parallelism and concurrency - Explore differences between programming for shared-memory and distributed-memory - Learn guidelines for designing multithreaded applications, including testing and tuning - Discover how to make best use of different threading libraries, including Windows threads, POSIX threads, OpenMP, and Intel Threading Building Blocks - Explore how to implement concurrent algorithms that involve sorting, searching, graphs, and other practical computationsThe Art of Concurrency shows you how to keep algorithms scalable to take advantage of new processors with even more cores. For developing parallel code algorithms for concurrent programming, this book is a must.

Anbieter: buecher
Stand: 05.08.2020
Zum Angebot
Things I Can't Explain: A Clarissa Novel  , Hör...
9,95 € *
ggf. zzgl. Versand

A complete reimagining of the 1990s television hit Clarissa Explains It All as 20-something Clarissa tries to navigate the unemployment line, mompreneurs, and the collision of two people in love. She was a smart, snappy, lighthearted girl who knew it all at 14 and let television audiences everywhere know it. Now a woman in her late 20s, her searching blue eyes are more serious but mostly amused by the people around her. The gap-toothed smile that made her seem younger than she really was is gone, but she still lightens up the room. Her unpredictable wardrobe rocks just like when she was a kid, but her fashion sense has evolved, and it makes men and women turn their heads. After leaving high school early, Clarissa interned at the Daily Post while attending night school. At the ripe old age of 22 she had it made - her own journalism beat (fashion, gender politics, and crime), an affordable apartment in FiDi, and a livable wage. She was so totally ahead of the game. Ah, those were the days! All three of them. Remember the stock market crash of '08? Remember when people actually bought newspapers? All of Clarissa's charming obsessions, charts, graphs, and superstitions have survived into adulthood, but they've evolved into an ever-greater need to claw the world back under control. Her mid-20s crisis has left her with a whole set of things she can't explain: an ex-boyfriend turned stalker, her parents' divorce, a micro relationship with the cute coffee guy, java addiction, "To-Flue Glue", and then there's Sam. Where's Sam anyway? Things I Can't Explain is about knowing it all in your teens and then feeling like you know nothing in your 20s. It is an entertaining and must-listen sequel for all fans of Mitchell Kriegman's Nickelodeon TV show Clarissa Explains It All. 1. Language: English. Narrator: Emily Madar. Audio sample: http://samples.audible.de/bk/adbl/025975/bk_adbl_025975_sample.mp3. Digital audiobook in aax.

Anbieter: Audible
Stand: 05.08.2020
Zum Angebot
Algorithms
54,99 € *
ggf. zzgl. Versand

Essential Information that Every Serious Programming Student Needs to Know about Algorithms and Data Structures A Classic Reference The latest version of Sedgewick's best-selling series, reflecting an indispensable body of knowledge developed over the past several decades. Broad Coverage Full treatment of data structures and algorithms for sorting, searching, graph processing, string processing, and geometric applications, including fifty algorithms every programmer should know. See www.cs.princeton.edu/algs4/top50 . Completely Revised Code New Java implementations written in an accessible, modular programming style, where all of the code is exposed to the reader and ready to use. New versions of quicksort, LZW compression, red-black tree search, RE pattern matching, and many other algorithms. Engages with Applications Algorithms are studied in the context of important scientific, engineering, and commercial applications. Clients and algorithms are expressed in real code, not the pseudo-code found in many other books. Intellectually Stimulating Engages reader interest with clear, concise text, detailed examples with visuals, carefully crafted code, historical and scientific context, and exercises at all levels. A Scientific Approach Develops precise statements about performance, supported by appropriate mathematical models and empirical studies validating those models. Integrated with the Web Visit www.cs.princeton.edu/algs4 for a freely accessible, comprehensive Web site, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources. Product Description This fourth edition of Robert Sedgewick and Kevin Wayne’s Algorithms is the leading textbook on algorithms today and is widely used in colleges and universities worldwide. This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts. The companion web site, algs4.cs.princeton.edu contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu . The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants. Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience. Features + Benefits The #1 practical resource for everyone seeking to run programs faster or solve larger problems Surveys today's most useful algorithms, with copious illustrations and examples Contains many new examples, ranging from physics, biology, and engineering to data compression and web search Contains real (not pseudocode) implementations, with detailed performance insights A companion web site, algs4.cs.princeton.edu , with many more resources for instructors, including text digests, program code, test data, programming projects, exercises, lecture slides, and other resources Preface viii Chapter 1: Fundamentals 3 1.1 Basic Programming Model 8 1.2 Data Abstraction 64 1.3 Bags, Queues, and Stacks 120 1.4 Analysis of Algorithms 172 1.5 Case Study: Union-Find 216 Chapter 2: Sorting 243 2.1 Elementary Sorts 244 2.2 Mergesort 270 2.3 Quicksort 288 2.4 Priority Queues 308 2.5 Applications 336 Chapter 3: Searching 361 3.1 Symbol Tables 362 3.2 Binary Search Trees 396 3.3 Balanced Search Trees 424 3.4 Hash Tables 458 3.5 Applications 486 Chapter 4: Graphs 515 4.1 Undirected Graphs 518 4.2 Directed Graphs 566 4.3 Minimum Spanning Trees 604 4.4 Shortest Paths 638 Chapter 5: Strings 695 5.1 String Sorts 702 5.2 Tries 730 5.3 Substring Search 758 5.4 Regular Expressions 788 5.5 Data Compression 810 Chapter 6: Context 853 Index 933 List of Algorithms 954 List of Clients 955 This fourth edition of Robert Sedgewick and Kevin Wayne's Algorithms is one of the most popular textbooks on algorithms today and is widely used in colleges and universities worldwide. The algorithms in this book - including 50 algorithms every programmer should know - represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering and for students who use computation in the liberal arts. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use. The companion web site, algs4.cs.princeton.edu, contains: An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course, offered each fall and spring, offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their state-of-the-art textbook, online content, and MOOC, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

Anbieter: buecher
Stand: 05.08.2020
Zum Angebot