Search results for "Frequently Asked Coding Interview - Algorithms"
Items we need to order for you

Visualisierungstechniken und Algorithmen
Dieser Band enthält die Beiträge eines Fachgesprächs, das am 26. und 27. September 1988 an der Technischen Universität Wien stattfand. Visualisierungstechniken sind ein zentrales Thema der Computer-Graphik mit zahlreichen Anwendungsgebieten. Neben den Fachbeiträgen bilden daher die Anwendungen einen wesentlichen Bestandteil des Fachgesprächs. Drei eingeladene Beiträge geben Übersichten über Visualisierungstechniken in der "Photogrammetrie und Fernerkundung", in der "Molecular Graphics", sowie bei komplexen, großen Datenmengen. In drei Minisymposien werden unterschiedliche Themen behandelt. Das erste gibt eine Darstellung verschiedener Anwendungen: "Visualisierung natürlicher Phänomene"; im zweiten werden Algorithmen untersucht: "Geometrische Verfahren der Graphischen Datenverarbeitung - Spezielle Visualisierungstechniken"; das dritte stellt das komplette Visualisierungssystem RISS vor, mit dem realistische Bilder durch Ray-Tracing erzeugt werden können. Die Themen der angenommenen Vorträge reichen von der Hardware für Computer-Graphik über spezielle Probleme und Verfahren der Raster-Graphik (Anti-Aliasing, Ray-Tracing) und Algorithmen bis zu weiteren Anwendungen (Medizin, Kartographie). Aber auch Fragen der Bildanalyse, Bildauswertung und Animation werden behandelt.
R 2,042.92


R 672.00

R 397.00


R 2,442.00



Combinatorial and Algorithmic Aspects of Networking
This book constitutes the thoroughly refereed post-proceedings of the Third Workshop on Combinatorial and Algorithmic Aspects of Networking, held in Chester, UK in July 2006, co-located with the 13th Colloquium on Structural Information and Communication Complexity, SIROCCO 2006.The 10 revised full papers and one invited lecture cover a range from the Web graph to game theory to string matching, all in the context of large-scale networks.
R 2,013.42




R 611.00

R 485.31

R 586.00

Combinatorial Algorithms for Integrated Circuit Layout
The last decade has brought explosive growth in the technology for manufac turing integrated circuits. Integrated circuits with several hundred thousand transistors are now commonplace. This manufacturing capability, combined with the economic benefits of large electronic systems, is forcing a revolution in the design of these systems and providing a challenge to those people in terested in integrated system design. Modern circuits are too complex for an individual to comprehend completely. Managing tremendous complexity and automating the design process have become crucial issues. Two groups are interested in dealing with complexity and in developing algorithms to automate the design process. One group is composed of practi tioners in computer-aided design (CAD) who develop computer programs to aid the circuit-design process. The second group is made up of computer scientists and mathemati'::~l\ns who are interested in the design and analysis of efficient combinatorial aJ::,orithms. These two groups have developed separate bodies of literature and, until recently, have had relatively little interaction. An obstacle to bringing these two groups together is the lack of books that discuss issues of importance to both groups in the same context. There are many instances when a familiarity with the literature of the other group would be beneficial. Some practitioners could use known theoretical results to improve their "cut and try" heuristics. In other cases, theoreticians have published impractical or highly abstracted toy formulations, thinking that the latter are important for circuit layout.
R 2,242.96

Fermion Algorithms - Proceedings Of The Workshop
Novel Monte Carlo Algorithms for Fermionic Systems are badly needed in high energy and solid state physics. At this workshop the newest developments in this direction were presented, in particular those concerning multi-grid techniques, cluster algorithms and massively parallel implementations.
R 3,444.00

R 611.00



R 502.00

R 305.00

R 1,084.00

R 660.00


R 550.00

Approximation and Online Algorithms
This book constitutes the thoroughly refereed post-proceedings of the 4th International Workshop on Approximation and Online Algorithms, WAOA 2006, held in Zurich, Switzerland in September 2006 as part of the ALGO 2006 conference event. The 26 revised full papers presented were carefully reviewed and selected from 62 submissions.
R 1,566.66


R 2,301.00


Proofs and Algorithms
Logic is a branch of philosophy, mathematics and computer science. It studies the required methods to determine whether a statement is true, such as reasoning and computation.Proofs and Algorithms: Introduction to Logic and Computability is an introduction to the fundamental concepts of contemporary logic - those of a proof, a computable function, a model and a set. It presents a series of results, both positive and negative, - Church's undecidability theorem, Gödel’s incompleteness theorem, the theorem asserting the semi-decidability of provability - that have profoundly changed our vision of reasoning, computation, and finally truth itself.Designed for undergraduate students, this book presents all that philosophers, mathematicians and computer scientists should know about logic.
R 1,130.05


New Data Structures and Algorithms for Logic Synthesis and Verification
This book introduces new logic primitives for electronic design automation tools. The author approaches fundamental EDA problems from a different, unconventional perspective, in order to demonstrate the key role of rethinking EDA solutions in overcoming technological limitations of present and future technologies. The author discusses techniques that improve the efficiency of logic representation, manipulation and optimization tasks by taking advantage of majority and biconditional logic primitives. Readers will be enabled to accelerate formal methods by studying core properties of logic circuits and developing new frameworks for logic reasoning engines.
R 2,102.27

R 1,312.00

Master Algorithm
Recommended by Bill Gates A thought-provoking and wide-ranging exploration of machine learning and the race to build computer intelligences as flexible as our own In the world's top research labs and universities, the race is on to invent the ultimate learning algorithm: one capable of discovering any knowledge from data, and doing anything we want, before we even ask. In The Master Algorithm, Pedro Domingos lifts the veil to give us a peek inside the learning machines that power Google, Amazon, and your smartphone. He assembles a blueprint for the future universal learner--the Master Algorithm--and discusses what it will mean for business, science, and society. If data-ism is today's philosophy, this book is its bible.
R 456.00

R 637.00

Algorithms, Artificial Intelligence and Beyond
This volume brings together eminent scholars from various parts of the world, representing different fields of knowledge in order to explore the social, cultural, political and economic effects of the development of new technologies.On the one hand, the book contextualises the discussion of algorithms and artificial intelligence (AI) within the broader framework of the digital revolution, on the other it also examines individual experiences and practices. Moreover, in light of the speed at which algorithms and AI are being incorporated into various aspects of life, contributors also question the ethical implications of their development. The widespread development of AI and algorithmic solutions is one of the most important contemporary phenomena. It has an overwhelming impact on the social and cultural life of the 21st century. In this context, one can point to both exciting examples of the application of algorithms and AI in business and popular culture, as well as the challenges of widening social inequality or the expanding scope of surveillance.The scope of the impact of algorithms and AI makes the formation of new theoretical frameworks vital. This is the aim of this book, which will be of interest to academics within the humanities and social sciences with an interest in technology and the impact of algorithms and AI on society and culture.
R 2,381.00

R 886.00

R 763.00

R 245.00

Algorithmic Algebraic Combinatorics and Gröbner Bases
In 2006 a special semester on Gr. obner bases and related methods was or- nized by RICAM and RISC, directed by Bruno Buchberger and Heinz Engl. The main focus of the semester were the development of the formal theory of Gr. obner bases (brie?y GB), the e?cient implementation of all algorithms related to this theory, and the promotion of recent and new applications of GB. The workshop D1 "Gr. obner bases in cryptography, coding theory and - gebraic combinatorics", Linz, May 1-6, 2006 (chairmen M. Klin, L. Perret, M. Sala) was one of the main ingredients of the semester. The last two days of this workshop, devoted to combinatorics, made it possible to bring together experts in algorithmic problems related to coherent con?gurations and as- ciation schemes with a community of people working in the area of GB. Each side was interested in understanding the computational problems and current algorithmicpossibilitiesoftheother,withaparticularobjectiveofintroducing the practical use of GB in algebraic combinatorics. Materials (mainly slides of lectures and posters) available from the site http://www.ricam.oeaw.ac.at/specsem/srs/groeb/schedule D1.htmlprovidea helpful and vivid picture of the successful exchange of scienti?c information during the workshop D1. Asafollow-uptothespecialsemester,10volumesofproceedingsarebeing published by di?erent publishers. The current collection of papers re?ects diverse investigations in the area of algebraic combinatorics (with or without explicit use of GB), but with a de?nite emphasis on algorithmic approaches.
R 7,711.46

R 750.52

R 305.00

R 1,125.16

R 494.00

R 610.00


R 680.00
















































