Angebote zu "Graphen" (54 Treffer)

Programming Entity Framework: DbContext
€ 17.99 *
ggf. zzgl. Versand

The DbContext API captures Entity Framework?s (EF) most commonly used features and tasks, simplifying development with EF. This concise book shows you how to use the API to perform set operations with the DbSet class, handle change tracking and resolve concurrency conflicts with the Change Tracker API, and validate changes to your data with the Validation API. With DbContext, you?ll be able to query and update data, whether you?re working with individual objects or graphs of objects and their related data. You?ll find numerous C# code samples to help you get started. All you need is experience with Visual Studio and database management basics. * Use EF?s query capabilities to retrieve data, and use LINQ to sort and filter data * Learn how to add new data, and change and delete existing data * Use the Change Tracker API to access information EF keeps about the state of entity instances * Control change tracking information of entities in disconnected scenarios, including NTier applications * Validate data changes before they?re sent to the database, and set up validation rules * Bypass EF?s query pipeline and interact directly with the database

Anbieter: buecher.de
Stand: Feb 14, 2019
Zum Angebot
Information Theory, Inference and Learning Algo...
€ 49.99 *
ggf. zzgl. Versand

Information theory and inference, taught together in this exciting textbook, lie at the heart of many important areas of modern technology - communication, signal processing, data mining, machine learning, pattern recognition, computational neuroscience, bioinformatics and cryptography. The book introduces theory in tandem with applications. Information theory is taught alongside practical communication systems such as arithmetic coding for data compression and sparse-graph codes for error-correction. Inference techniques, including message-passing algorithms, Monte Carlo methods and variational approximations, are developed alongside applications to clustering, convolutional codes, independent component analysis, and neural networks. Uniquely, the book covers state-of-the-art error-correcting codes, including low-density-parity-check codes, turbo codes, and digital fountain codes - the twenty-first-century standards for satellite communications, disk drives, and data broadcast. Richly illustrated, filled with worked examples and over 400 exercises, some with detailed solutions, the book is ideal for self-learning, and for undergraduate or graduate courses. It also provides an unparalleled entry point for professionals in areas as diverse as computational biology, financial engineering and machine learning.

Anbieter: buecher.de
Stand: Feb 14, 2019
Zum Angebot
Data Visualization With Javascript
€ 33.99 *
ggf. zzgl. Versand

You´ve got data to communicate. But what kind of visualization do you choose, how do you build it, and how do you ensure that it´s up to the demands of the Web? In Data Visualization with JavaScript, you´ll learn how to use JavaScript, HTML, and CSS to build the most practical visualizations for your data. Step-by-step examples walk you through creating, integrating, and debugging different types of visualizations and will have you building basic visualizations, like bar, line, and scatter graphs, in no time. Then you´ll move on to more advanced topics, including how to: - Create tree maps, heat maps, network graphs, word clouds, and timelines - Map geographic data, and build sparklines and composite charts - Add interactivity and retrieve data with AJAX - Manage data in the browser and build data-driven web applications - Harness the power of the Flotr2, Flot, Chronoline.js, D3.js, Underscore.js, and Backbone.js libraries If you already know your way around building a web page but aren´t quite sure how to build a good visualization, Data Visualization with JavaScript will help you get your feet wet without throwing you into the deep end. Before you know it, you´ll be well on your way to creating simple, powerful data visualizations.

Anbieter: buecher.de
Stand: Feb 14, 2019
Zum Angebot
Guide to Competitive Programming
€ 36.99 *
ggf. zzgl. Versand

This invaluable textbook presents a comprehensive introduction to modern competitive programming. The text highlights how competitive programming has proven to be an excellent way to learn algorithms, by encouraging the design of algorithms that actually work, stimulating the improvement of programming and debugging skills, and reinforcing the type of thinking required to solve problems in a competitive setting. The book contains many ´´folklore´´ algorithm design tricks that are known by experienced competitive programmers, yet which have previously only been formally discussed in online forums and blog posts. Topics and features: reviews the features of the C++ programming language, and describes how to create efficient algorithms that can quickly process large data sets; discusses sorting algorithms and binary search, and examines a selection of data structures of the C++ standard library; introduces the algorithm design technique of dynamic programming, and investigates elementary graph algorithms; covers such advanced algorithm design topics as bit-parallelism and amortized analysis, and presents a focus on efficiently processing array range queries; surveys specialized algorithms for trees, and discusses the mathematical topics that are relevant in competitive programming; examines advanced graph techniques, geometric algorithms, and string techniques; describes a selection of more advanced topics, including square root algorithms and dynamic programming optimization. This easy-to-follow guide is an ideal reference for all students wishing to learn algorithms, and practice for programming contests. Knowledge of the basics of programming is assumed, but previous background in algorithm design or programming contests is not necessary. Due to the broad range of topics covered at various levels of difficulty, this book is suitable for both beginners and more experienced readers.

Anbieter: buecher.de
Stand: Feb 14, 2019
Zum Angebot
Algorithms and Data Structures
€ 36.99 *
ggf. zzgl. Versand

Algorithms are at the heart of every nontrivial computer application, and algorithmics is a modern and active area of computer science. Every computer scientist and every professional programmer should know about the basic algorithmic toolbox: structures that allow efficient organization and retrieval of data, frequently used algorithms, and basic techniques for modeling, understanding and solving algorithmic problems. This book is a concise introduction addressed to students and professionals familiar with programming and basic mathematical language. Individual chapters cover arrays and linked lists, hash tables and associative arrays, sorting and selection, priority queues, sorted sequences, graph representation, graph traversal, shortest paths, minimum spanning trees, and optimization. The algorithms are presented in a modern way, with explicitly formulated invariants, and comment on recent trends such as algorithm engineering, memory hierarchies, algorithm libraries and certifying algorithms. The authors use pictures, words and high-level pseudocode to explain the algorithms, and then they present more detail on efficient implementations using real programming languages like C++ and Java. The authors have extensive experience teaching these subjects to undergraduates and graduates, and they offer a clear presentation, with examples, pictures, informal explanations, exercises, and some linkage to the real world. Most chapters have the same basic structure: a motivation for the problem, comments on the most important applications, and then simple solutions presented as informally as possible and as formally as necessary. For the more advanced issues, this approach leads to a more mathematical treatment, including some theorems and proofs. Finally, each chapter concludes with a section on further findings, providing views on the state of research, generalizations and advanced solutions.

Anbieter: buecher.de
Stand: Feb 14, 2019
Zum Angebot
An Introduction to Kolmogorov Complexity and It...
€ 56.99 *
ggf. zzgl. Versand

´´The book is outstanding and admirable in many respects. ... is necessary reading for all kinds of readers from undergraduate students to top authorities in the field.´´ Journal of Symbolic Logic Written by two experts in the field, this is the only comprehensive and unified treatment of the central ideas and applications of Kolmogorov complexity. The book presents a thorough treatment of the subject with a wide range of illustrative applications. Such applications include the randomness of finite objects or infinite sequences, Martin-Loef tests for randomness, information theory, computational learning theory, the complexity of algorithms, and the thermodynamics of computing. It will be ideal for advanced undergraduate students, graduate students, and researchers in computer science, mathematics, cognitive sciences, philosophy, artificial intelligence, statistics, and physics. The book is self-contained in that it contains the basic requirements from mathematics and computer science. Included are also numerous problem sets, comments, source references, and hints to solutions of problems. New topics in this edition include Omega numbers, Kolmogorov-Loveland randomness, universal learning, communication complexity, Kolmogorov´s random graphs, time-limited universal distribution, Shannon information and others.

Anbieter: buecher.de
Stand: Feb 14, 2019
Zum Angebot
Advanced Software Technologies for Post-Peta Sc...
€ 87.99 *
ggf. zzgl. Versand

Covering research topics from system software such as programming languages, compilers, runtime systems, operating systems, communication middleware, and large-scale file systems, as well as application development support software and big-data processing software, this book presents cutting-edge software technologies for extreme scale computing. The findings presented here will provide researchers in these fields with important insights for the further development of exascale computing technologies. This book grew out of the post-peta CREST research project funded by the Japan Science and Technology Agency, the goal of which was to establish software technologies for exploring extreme performance computing beyond petascale computing. The respective were contributed by 14 research teams involved in the project. In addition to advanced technologies for large-scale numerical computation, the project addressed the technologies required for big data and graph processing, the complexity of memory hierarchy, and the power problem. Mapping the direction of future high-performance computing was also a central priority.

Anbieter: buecher.de
Stand: Feb 14, 2019
Zum Angebot
Algebraic Cryptanalysis
€ 130.99 *
ggf. zzgl. Versand

Algebraic Cryptanalysis bridges the gap between a course in cryptography, and being able to read the cryptanalytic literature. This book is divided into three parts: Part One covers the process of turning a cipher into a system of equations; Part Two covers finite field linear algebra; Part Three covers the solution of Polynomial Systems of Equations, with a survey of the methods used in practice, including SAT-solvers and the methods of Nicolas Courtois. Topics include: Analytic Combinatorics, and its application to cryptanalysis The equicomplexity of linear algebra operations Graph coloring Factoring integers via the quadratic sieve, with its applications to the cryptanalysis of RSA Algebraic Cryptanalysis is designed for advanced-level students in computer science and mathematics as a secondary text or reference book for self-guided study. This book is suitable for researchers in Applied Abstract Algebra or Algebraic Geometry who wish to find more applied topics or practitioners working for security and communications companies.

Anbieter: buecher.de
Stand: Feb 14, 2019
Zum Angebot
Algorithms
€ 64.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

Anbieter: buecher.de
Stand: Feb 14, 2019
Zum Angebot
Machine Learning and Knowledge Discovery in Dat...
€ 85.99 *
ggf. zzgl. Versand

The three volume proceedings LNAI 11051 - 11053 constitutes the refereed proceedings of the European Conference on Machine Learning and Knowledge Discovery in Databases, ECML PKDD 2018, held in Dublin, Ireland, in September 2018. The total of 131 regular papers presented in part I and part II was carefully reviewed and selected from 535 submissions; there are 52 papers in the applied data science, nectar and demo track. The contributions were organized in topical sections named as follows: Part I: adversarial learning; anomaly and outlier detection; applications; classification; clustering and unsupervised learning; deep learningensemble methods; and evaluation. Part II: graphs; kernel methods; learning paradigms; matrix and tensor analysis; online and active learning; pattern and sequence mining; probabilistic models and statistical methods; recommender systems; and transfer learning. Part III: ADS data science applications; ADS e-commerce; ADS engineering and design; ADS financial and security; ADS health; ADS sensing and positioning; nectar track; and demo track.

Anbieter: buecher.de
Stand: Feb 14, 2019
Zum Angebot