Автор: Robert Sedgewick Название: Algorithms in java, parts 1-4 ISBN: 0201361205 ISBN-13(EAN): 9780201361209 Издательство: Pearson Education Цена: 5022 р. Наличие на складе: Невозможна поставка. Описание: Provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. This book includes Java class implementations of more than 100 important practical algorithms. It emphasises on ADTs, modular programming, and object-oriented programming. It also covers arrays, linked lists, trees, and more.
Автор: Cormen, Thomas H., E Название: Introduction to algorithms 3 ed. ISBN: 0262033844 ISBN-13(EAN): 9780262033848 Издательство: MIT Press Рейтинг: Цена: 12267 р. Наличие на складе: Ожидается поступление.
Описание: A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-base flow.
Автор: Woo Название: Shadow Algorithms Data Miner ISBN: 1439880239 ISBN-13(EAN): 9781439880234 Издательство: Taylor&Francis Рейтинг: Цена: 8936 р. Наличие на складе: Невозможна поставка.
Описание: Shadow Algorithms Data Miner provides a high-level understanding of the complete set of shadow concepts and algorithms, addressing their usefulness from a larger graphics system perspective. It discusses the applicability and limitations of all the direct illumination approaches for shadow generation. With an emphasis on shadow fundamentals, the book gives an organized picture of the motivations, complexities, and categorized algorithms available to generate digital shadows. It helps readers select the most relevant algorithms for their needs by placing the shadow algorithms in real-world contexts and looking at them from a larger graphics system perspective. As a result, readers know where to start for their application needs, which algorithms to begin considering, and which papers and supplemental material should be consulted for further details.
Описание: SLS methods include a wide spectrum of te- niques, ranging from constructive search procedures and iterative improvement algorithms to more complex SLS methods, such as ant colony optimization, evolutionary computation, iterated local search, memetic algorithms, simulated annealing, tabu search, and variable neighborhood search.
Описание: This book constitutes the thoroughly refereed post proceedings of the Third International Workshop on Approximation and Online Algorithms, WAOA 2005, held in Palma de Mallorca, Spain in October 2005 as part of the ALGO 2005 event.The 26 revised full papers presented were carefully reviewed and selected from 68 submissions. Topics addressed by the workshop are algorithmic game theory, approximation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, inapproximability results, mechanism design, network design, packing and covering, paradigms, randomization techniques, real-world applications, and scheduling problems.
A comprehensive guide to distributed algorithms that emphasizes examples and exercises rather than mathematical argumentation.
This book offers students and researchers a guide to distributed algorithms that emphasizes examples and exercises rather than the intricacies of mathematical models. It avoids mathematical argumentation, often a stumbling block for students, teaching algorithmic thought rather than proofs and logic. This approach allows the student to learn a large number of algorithms within a relatively short span of time. Algorithms are explained through brief, informal descriptions, illuminating examples, and practical exercises. The examples and exercises allow readers to understand algorithms intuitively and from different perspectives. Proof sketches, arguing the correctness of an algorithm or explaining the idea behind fundamental results, are also included. An appendix offers pseudocode descriptions of many algorithms.
Distributed algorithms are performed by a collection of computers that send messages to each other or by multiple software threads that use the same shared memory. The algorithms presented in the book are for the most part "classics," selected because they shed light on the algorithmic design of distributed systems or on key issues in distributed computing and concurrent programming.
Distributed Algorithms can be used in courses for upper-level undergraduates or graduate students in computer science, or as a reference for researchers in the field.
Автор: Schapire Robert E., Freund Yoav Название: Boosting: Foundations and Algorithms ISBN: 0262526034 ISBN-13(EAN): 9780262526036 Издательство: MIT Press Рейтинг: Цена: 4382 р. Наличие на складе: Поставка под заказ.
An accessible introduction and essential reference for an approach to machine learning that creates highly accurate prediction rules by combining many weak and inaccurate ones.
Boosting is an approach to machine learning based on the idea of creating a highly accurate predictor by combining many weak and inaccurate "rules of thumb." A remarkably rich theory has evolved around boosting, with connections to a range of topics, including statistics, game theory, convex optimization, and information geometry. Boosting algorithms have also enjoyed practical success in such fields as biology, vision, and speech processing. At various times in its history, boosting has been perceived as mysterious, controversial, even paradoxical.
This book, written by the inventors of the method, brings together, organizes, simplifies, and substantially extends two decades of research on boosting, presenting both theory and applications in a way that is accessible to readers from diverse backgrounds while also providing an authoritative reference for advanced researchers. With its introductory treatment of all material and its inclusion of exercises in every chapter, the book is appropriate for course use as well.
The book begins with a general introduction to machine learning algorithms and their analysis; then explores the core theory of boosting, especially its ability to generalize; examines some of the myriad other theoretical viewpoints that help to explain and understand boosting; provides practical extensions of boosting for more complex learning problems; and finally presents a number of advanced theoretical topics. Numerous applications and practical illustrations are offered throughout.
Автор: Keith Crandall; Jens Lagergren Название: Algorithms in Bioinformatics ISBN: 3540873600 ISBN-13(EAN): 9783540873600 Издательство: Springer Рейтинг: Цена: 10047 р. Наличие на складе: Поставка под заказ.
Описание: Constitutes the refereed proceedings of the 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting. This title includes topics that range in biological applicability from genome mapping, to sequence assembly, to microarray quality, to molecular modeling.
Автор: Kurt Mehlhorn Название: Algorithms - ESA 2008 ISBN: 3540877436 ISBN-13(EAN): 9783540877431 Издательство: Springer Рейтинг: Цена: 16169 р. Наличие на складе: Поставка под заказ.
Описание: Constitutes the proceedings of the 16th Annual European Symposium on Algorithms, ESA 2008, held in Karlsruhe, Germany, in September 2008 in the context of the combined conference ALGO 2008. This title includes the papers that address various subjects in algorithmics reaching from design and analysis issues of algorithms.
Описание: Constitutes the refereed proceedings of the 9th International Colloquium on Grammatical Inference, ICGI 2008, held in Saint-Malo, France, in September 2008. This title also includes papers on topics ranging from theoretical results of learning algorithms to innovative applications of grammatical inference.
Описание: High Performance Deformable Image Registration Algorithms for Manycore Processors develops highly data-parallel image registration algorithms suitable for use on modern multi-core architectures, including graphics processing units (GPUs). Focusing on deformable registration, we show how to develop data-parallel versions of the registration algorithm suitable for execution on the GPU. Image registration is the process of aligning two or more images into a common coordinate frame and is a fundamental step to be able to compare or fuse data obtained from different sensor measurements. Extracting useful information from 2D/3D data is essential to realizing key technologies underlying our daily lives. Examples include autonomous vehicles and humanoid robots that can recognize and manipulate objects in cluttered environments using stereo vision and laser sensing and medical imaging to localize and diagnose tumors in internal organs using data captured by CT/MRI scans.
Автор: MacCormick John Название: Nine Algorithms That Changed the Future ISBN: 0691158193 ISBN-13(EAN): 9780691158198 Издательство: Wiley Рейтинг: Цена: 1924 р. Наличие на складе: Невозможна поставка.
Every day, we use our computers to perform remarkable feats. A simple web search picks out a handful of relevant needles from the world's biggest haystack: the billions of pages on the World Wide Web. Uploading a photo to Facebook transmits millions of pieces of information over numerous error-prone network links, yet somehow a perfect copy of the photo arrives intact. Without even knowing it, we use public-key cryptography to transmit secret information like credit card numbers; and we use digital signatures to verify the identity of the websites we visit. How do our computers perform these tasks with such ease?
This is the first book to answer that question in language anyone can understand, revealing the extraordinary ideas that power our PCs, laptops, and smartphones. Using vivid examples, John MacCormick explains the fundamental "tricks" behind nine types of computer algorithms, including artificial intelligence (where we learn about the "nearest neighbor trick" and "twenty questions trick"), Google's famous PageRank algorithm (which uses the "random surfer trick"), data compression, error correction, and much more.
These revolutionary algorithms have changed our world: this book unlocks their secrets, and lays bare the incredible ideas that our computers use every day.
Автор: Edelsbrunner Herbert Название: Algorithms in Combinatorial Geometry ISBN: 3642648738 ISBN-13(EAN): 9783642648731 Издательство: Springer Цена: 15009 р. Наличие на складе: Поставка под заказ.
ООО "Логосфера " Тел:+7(495) 980-12-10 www.logobook.ru