Angebote zu "Hashing" (33 Treffer)

Kategorien

Shops

Hashing Searching Sketching
58,99 € *
ggf. zzgl. Versand

Hashing Searching Sketching ab 58.99 € als Taschenbuch: . Aus dem Bereich: Bücher, English, International, Gebundene Ausgaben,

Anbieter: hugendubel
Stand: 30.05.2020
Zum Angebot
Fast String Searching Based on Multilevel Hashing
64,99 € *
ggf. zzgl. Versand

Fast String Searching Based on Multilevel Hashing ab 64.99 € als Taschenbuch: Building Word Dictionary for Fast String Search. Aus dem Bereich: Bücher, Ratgeber, Computer & Internet,

Anbieter: hugendubel
Stand: 30.05.2020
Zum Angebot
Hashing based effective indexing for video retr...
54,90 € *
ggf. zzgl. Versand

This book more focuses on e-lecture video retrieval using text quires for searching appropriate lecture videos accurately and within less time using hashing techniques.On World Wide Web e-lecturing data of videos is increasing very fast. Thus efficient retrieval and indexing of video from large video databases is needed. We can use text appearing in lecture videos as index. It enables content-based browsing. We present method of hashing for efficient search of text in videos. Standard OCR package can be used to pass output directly in order to translate the segmented text into ASCII. For storing these text extracted video we are using hashing technique. This maintain the local information of each individual frame with its text which is extracted from it. It also considers the local structures for all the features globally. These local structures are used to find group of hash codes to plan text from the video key-frames, this will take minimum time to search videos in large dataset and retrieve videos faster.

Anbieter: buecher
Stand: 30.05.2020
Zum Angebot
Hashing based effective indexing for video retr...
56,50 € *
ggf. zzgl. Versand

This book more focuses on e-lecture video retrieval using text quires for searching appropriate lecture videos accurately and within less time using hashing techniques.On World Wide Web e-lecturing data of videos is increasing very fast. Thus efficient retrieval and indexing of video from large video databases is needed. We can use text appearing in lecture videos as index. It enables content-based browsing. We present method of hashing for efficient search of text in videos. Standard OCR package can be used to pass output directly in order to translate the segmented text into ASCII. For storing these text extracted video we are using hashing technique. This maintain the local information of each individual frame with its text which is extracted from it. It also considers the local structures for all the features globally. These local structures are used to find group of hash codes to plan text from the video key-frames, this will take minimum time to search videos in large dataset and retrieve videos faster.

Anbieter: buecher
Stand: 30.05.2020
Zum Angebot
Data Structures and Algorithms Made Easy
23,99 € *
ggf. zzgl. Versand

Peeling Data Structures and Algorithms: Table of Contents: goo.gl/JFMgiU Sample Chapter: goo.gl/n2Hk4i Found Issue? goo.gl/forms/4Gt72YO81I Videos: goo.gl/BcHq74 "Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems. Topics Covered: Introduction Recursion and Backtracking Linked Lists Stacks Queues Trees Priority Queue and Heaps Disjoint Sets ADT Graph Algorithms Sorting Searching Selection Algorithms [Medians] Symbol Tables Hashing String Algorithms Algorithms Design Techniques Greedy Algorithms Divide and Conquer Algorithms Dynamic Programming Complexity Classes Miscellaneous Concepts

Anbieter: buecher
Stand: 30.05.2020
Zum Angebot
Data Structures and Algorithms Made Easy
23,99 € *
ggf. zzgl. Versand

Peeling Data Structures and Algorithms: Table of Contents: goo.gl/JFMgiU Sample Chapter: goo.gl/n2Hk4i Found Issue? goo.gl/forms/4Gt72YO81I Videos: goo.gl/BcHq74 "Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles" is a book that offers solutions to complex data structures and algorithms. There are multiple solutions for each problem and the book is coded in C/C++, it comes handy as an interview and exam guide for computer scientists. A handy guide of sorts for any computer science professional, Data Structures And Algorithms Made Easy: Data Structures and Algorithmic Puzzles is a solution bank for various complex problems related to data structures and algorithms. It can be used as a reference manual by those readers in the computer science industry. This book serves as guide to prepare for interviews, exams, and campus work. In short, this book offers solutions to various complex data structures and algorithmic problems. Topics Covered: Introduction Recursion and Backtracking Linked Lists Stacks Queues Trees Priority Queue and Heaps Disjoint Sets ADT Graph Algorithms Sorting Searching Selection Algorithms [Medians] Symbol Tables Hashing String Algorithms Algorithms Design Techniques Greedy Algorithms Divide and Conquer Algorithms Dynamic Programming Complexity Classes Miscellaneous Concepts

Anbieter: buecher
Stand: 30.05.2020
Zum Angebot
Algorithms in C++, Parts 1-4 (eBook, PDF)
36,95 € *
ggf. zzgl. Versand

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations. Highlights Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

Anbieter: buecher
Stand: 30.05.2020
Zum Angebot
Algorithms in C++, Parts 1-4 (eBook, PDF)
36,95 € *
ggf. zzgl. Versand

Robert Sedgewick has thoroughly rewritten and substantially expanded and updated his popular work to provide current and comprehensive coverage of important algorithms and data structures. Christopher Van Wyk and Sedgewick have developed new C++ implementations that both express the methods in a concise and direct manner, and also provide programmers with the practical means to test them on real applications. Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 250,000 programmers! This particular book, Parts 1n4, represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Van Wyk and Sedgewick also exploit the natural match between C++ classes and ADT implementations. Highlights Expanded coverage of arrays, linked lists, strings, trees, and other basic data structures Greater emphasis on abstract data types (ADTs), modular programming, object-oriented programming, and C++ classes than in previous editions Over 100 algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT (searching) implementations New implementations of binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and much more Increased quantitative information about the algorithms, giving you a basis for comparing them Over 1000 new exercises to help you learn the properties of algorithms Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.

Anbieter: buecher
Stand: 30.05.2020
Zum Angebot
The MMIX Supplement
24,99 € *
ggf. zzgl. Versand

The MMIX Supplement: Supplement to The Art of Computer ProgrammingVolumes 1, 2, 3 by Donald E. Knuth “I encourage serious programmers everywhere to sharpen their skills by devouring this book.” –Donald E. Knuth In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth’s guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth’s Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic. Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality. The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth’s Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original–preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth’s insights in modern environments, until his revised, “ultimate” edition of The Art of Computer Programming is available. From Donald E. Knuth’s Foreword: “I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.” Dr. Martin Ruckert maintains the MMIX home page at mmix.cs.hm.edu . He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany. Product Description The MMIX Supplement: Supplement to The Art of Computer ProgrammingVolumes 1, 2, 3 by Donald E. Knuth “I encourage serious programmers everywhere to sharpen their skills by devouring this book.” –Donald E. Knuth In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth’s guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth’s Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic. Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality. The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth’s Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original–preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth’s insights in modern environments, until his revised, “ultimate” edition of The Art of Computer Programming is available. From Donald E. Knuth’s Foreword: “I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.” Dr. Martin Ruckert maintains the MMIX home page at mmix.cs.hm.edu . He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany. Foreword iii Preface v Style Guide viii Programming Techniques xii Chapter 1: Basic Concepts 1 1.3.3. Applications to Permutations 1 1.4.4. Input and Output 8 Chapter 2: Information Structures 15 2.1. Introduction 15 2.2.2. Sequential Allocation 17 2.2.3. Linked Allocation 18 2.2.4. Circular Lists 25 2.2.5. Doubly Linked Lists 27 2.2.6. Arrays and Orthogonal Lists 36 2.3.1. Traversing Binary Trees 37 2.3.2. Binary Tree Representation of Trees 39 2.3.3. Other Representations of Trees 43 2.3.5. Lists and Garbage Collection 44 2.5. Dynamic Storage Allocation 45 Chapter 3: Random Numbers 48 3.2.1.1. Choice of modulus 48 3.2.1.3. Potency 49 3.2.2. Other Methods 50 3.4.1. Numerical Distributions 51 3.6. Summary 52 Chapter 4: Arithmetic 53 4.1. Positional Number Systems 53 4.2.1. Single-Precision Calculations 53 4.2.2. Accuracy of Floating Point Arithmetic 58 4.2.3. Double-Precision Calculations 58 4.3.1. The Classical Algorithms 62 4.4. Radix Conversion 68 4.5.2. The Greatest Common Divisor 70 4.5.3. Analysis of Euclid’s Algorithm 71 4.5.4. Factoring into Primes 72 4.6.3. Evaluation of Powers 72 4.6.4. Evaluation of Polynomials 73 Chapter 5: Sorting 74 5.2. Internal Sorting 74 5.2.1. Sorting by Insertion 76 5.2.2. Sorting by Exchanging 81 5.2.3. Sorting by Selection 87 5.2.4. Sorting by Merging 89 5.2.5. Sorting by Distribution 93 5.3.1. Minimum-Comparison Sorting 94 5.5. Summary, History, and Bibliography 95 Chapter 6: Searching 97 6.1. Sequential Searching 97 6.2.1. Searching an Ordered Table 99 6.2.2. Binary Tree Searching 102 6.2.3. Balanced Trees 103 6.3. Digital Searching 106 6.4. Hashing 108 Answers to Exercises 117 1.3.2. The MMIX Assembly Language 117 1.3.3. Applications to Permutations 120 1.4.4. Input and Output 120 2.1. Introduction 122 2.2.2. Sequential Allocation 123 2.2.3. Linked Allocation 124 2.2.4. Circular Lists 128 2.2.5. Doubly Linked Lists 130 2.2.6. Arrays and Orthogonal Lists 132 2.3.1. Traversing Binary Trees 134 2.3.2. Binary Tree Representation of Trees 136 2.3.5. Lists and Garbage Collection 139 2.5. Dynamic Storage Allocation 140 3.2.1.1. Choice of modulus 147 3.2.1.3. Potency 148 3.2.2. Other Methods 148 3.4.1. Numerical Distributions 149 3.6. Summary 150 4.1. Positional Number Systems 150 4.2.1. Single-Precision Calculations 151 4.2.2. Accuracy of Floating Point Arithmetic 152 4.2.3. Double-Precision Calculations 153 4.3.1. The Classical Algorithms 156 4.4. Radix Conversion 158 4.5.2. The Greatest Common Divisor 160 4.5.3. Analysis of Euclid’s Algorithm 160 4.6.3. Evaluation of Powers 161 4.6.4. Evaluation of Polynomials 161 5. Sorting 162 5.2. Internal Sorting 162 5.2.1. Sorting by Insertion 165 5.2.2. Sorting by Exchanging 169 5.2.3. Sorting by Selection 174 5.2.4. Sorting by Merging 175 5.2.5. Sorting by Distribution 179 5.3.1. Minimum-Comparison Sorting 180 5.5. Summary, History, and Bibliography 183 6.1. Sequential Searching 183 6.2.1. Searching an Ordered Table 184 6.2.2. Binary Tree Searching 185 6.2.3. Balanced Trees 185 6.3. Digital Searching 185 6.4. Hashing 186 Acknowledgments 188 Index 189The MMIX Supplement: Supplement to The Art of Computer ProgrammingVolumes 1, 2, 3 by Donald E. Knuth "I encourage serious programmers everywhere to sharpen their skills by devouring this book.” -Donald E. Knuth In the first edition of Volume 1 of The Art of Computer Programming, Donald E. Knuth introduced the MIX computer and its machine language: a teaching tool that powerfully illuminated the inner workings of the algorithms he documents. Later, with the publication of his Fascicle 1, Knuth introduced MMIX: a modern, 64-bit RISC replacement to the now-obsolete MIX. Now, with Knuth's guidance and approval, Martin Ruckert has rewritten all MIX example programs from Knuth's Volumes 1-3 for MMIX, thus completing this MMIX update to the original classic. Building on contributions from the international MMIXmasters volunteer group, Ruckert fully addresses MMIX basic concepts, information structures, random numbers, arithmetic, sorting, and searching. In the preparation of this supplement, about 15,000 lines of MMIX code were written and checked for correctness; over a thousand test cases were written and executed to ensure the code is of the highest possible quality. The MMIX Supplement should be read side by side with The Art of Computer Programming, Volumes 1-3, and Knuth's Fascicle 1, which introduces the MMIX computer, its design, and its machine language. Throughout, this supplement contains convenient page references to corresponding coverage in the original volumes. To further simplify the transition to MMIX, Ruckert stayed as close as possible to the original-preserving programming style, analysis techniques, and even wording, while highlighting differences where appropriate. The resulting text will serve as a bridge to the future, helping readers apply Knuth's insights in modern environments, until his revised, "ultimate” edition of The Art of Computer Programming is available. From Donald E. Knuth's Foreword: "I am thrilled to see the present book by Martin Ruckert: It is jam-packed with goodies from which an extraordinary amount can be learned. Martin has not merely transcribed my early programs for MIX and recast them in a modern idiom. He has penetrated to their essence and rendered them anew with elegance and good taste. His carefully checked code represents a significant contribution to the art of pedagogy as well as to the art of programming.” Dr. Martin Ruckert maintains the MMIX home page at . He is professor of mathematics and computer science at Munich University of Applied Sciences in Munich, Germany.

Anbieter: buecher
Stand: 30.05.2020
Zum Angebot