الصفحة 1
الصفحة 1
WALCOM: Algorithms and Computation ; 2nd International Workshop, WALCOM 2008, Dhaka, Bangladesh, February 7-8, 2008. Proceedings
This book features original research in the areas of algorithms and data structures, combinatorial algorithms, graph drawings and graph algorithms, parallel and distributed algorithms, string algorithms, computational geometry, graphs in bioinformatics and computational biology. The book is organized in topical sections on bioinformatics algorithms, computational geometry and graph drawing, graph algorithms, and algorithm engineering.
VR Technologies in Cultural Heritage : First International Conference, VRTCH 2018, Brasov, Romania, May 29–30, 2018, Revised Selected Papers
Organized in topical sections on data acquisition and modelling, visualization methods / audio, sensors and actuators, data management, restoration and digitization, cultural tourism.
VizSEC 2007 ; Proceedings of the Workshop on Visualization for Computer Security
Networked computers are ubiquitous, and are subject to attack, misuse, and abuse. One method to counteracting this cyber threat is to provide security analysts with better tools to discover patterns, detect anomalies, identify correlations, and communicate their findings. Visualization for computer security (VizSec) researchers and developers are doing just that. VizSec is about putting robust information visualization tools into the hands of human analysts to take advantage of the power of the human perceptual and cognitive processes in solving computer security problems.
Visualization for Computer Security ; 5th International Workshop, VizSec 2008, Cambridge, MA, USA, September 15, 2008. Proceedings
This book has focused on helping human analysts to detect anomalies and patterns, particularly in computer network defense.
Verification, model checking, and abstract interpretation ; Vol. 3385 ; 6th International Conference, VMCAI 2005, Paris, France, January 17-19, 2005, Proceedings
The 27 revised full papers presented here, together with one invited paper were carefully reviewed and selected from 58 submissions. The papers feature current research from the communities of verification, model checking, and abstract interpretation, facilitating interaction, cross-fertilization, and advancement of hybrid methods.
Verification, Model Checking, and Abstract Interpretation ; 8th International Conference, VMCAI 2007, Nice, France, January 14-16, 2007, Proceedings
Contains the papers presented at VMCAI 2007: Verification, Model Checking and Abstract Interpretation held January 14–16, 2007 in Nice. VMCAI provides a forum for researchers from the communities of verification, model checking, and abstract interpretation, facilitating interaction, cross-fertilization,and dvancement of hybrid methods that combine the three areas.
Trust Management II; Proceedings of IFIPTM 2008 : Joint iTrust and PST Conferences on Privacy, Trust Management and Security, June 18-20, 2008, Trondheim, Norway
The scope of the book includes: foundations of computer science; software theory and practice; education; computer applications in technology; communication systems; systems modeling and optimization; information systems; computers and society; computer systems technology; security and protection in information processing systems; artificial intelligence; and human-computer interaction.
Triangulations and Applications
This book is entirely about triangulations. With emphasis on computational issues, we present the basic theory necessary to construct and manipulate triangulations. In particular, we make a tour through the theory behind the Delaunay triangulation, including algorithms and software issues. We also discuss various data structures used for the representation of triangulations.
Tools and Algorithms for the Construction and Analysis of Systems ; Vol. 3920 ; 12th International Conference, TACAS 2006, Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2006, Vienna, Austria, March 25 - April 2, 2006, Proceedings
This book constitutes the refereed proceedings of the 12th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2005, held Austria in March/April 2006 as part of ETAPS.
Theoretical Introduction to Programming
Is there nothing more to programming? How can you develop your skill if all you do is hunt for the prescribed routine in a menu of 1001 others? Are you frustrated by the plethora of languages that ultimately do the same thing? Would you like your skills to give you lasting and intrinsic worth as an expert programmer, instead of going stale like last week's bread? Would you like to know more about the nature and limits of programming? Can code be written so that it is intrinsically robust? Written rapidly without sacrificing reliability? Written generically without iterative loops, without recursion, or even variables? This book shows you how. Densely packed with explicit techniques on each page, this book takes you from a rudimentary understanding of programming into the world of deep technical software development.
The self-taught computer scientist : The beginner's guide to data structures & algorithms
Introduces beginner and self-taught programmers to computer science fundamentals that are essential for success in programming and software engineering fields. Computer science is a massive subject that could cover an entire lifetime of learning. This book does not aim to cover everything you would learn about if you went to school to get a computer science degree. Instead, Cory’s goal is to give you an introduction to some of the most important concepts in computer science that apply to a programming career. With a focus on data structures and algorithms, The Self-Taught Computer Scientist helps you fill gaps in your knowledge, prepare for a technical interview, feel knowledgeable and confident on the job, and ultimately, become a better programmer.
The Modern Algebra of Information Retrieval
This book takes a unique approach to information retrieval by laying down the foundations for a modern algebra of information retrieval based on lattice theory. All major retrieval methods developed so far are described in detail ئ Boolean, Vector Space and probabilistic methods, but also Web retrieval algorithms like PageRank, HITS, and SALSA ئ and the author shows that they all can be treated elegantly in a unified formal way, using lattice theory as the one basic concept. Further, he also demonstrates that the lattice-based approach to information retrieval allows us to formulate new retrieval methods. Sándor Dominichѫs presentation is characterized by an engineering-like approach, describing all methods and technologies with as much mathematics as needed for clarity and exactness.
The Everyday Life of an Algorithm
This book begins with an algorithm–a set of IF…THEN rules used in the development of a new, ethical, video surveillance architecture for transport hubs. Readers are invited to follow the algorithm over three years, charting its everyday life. Questions of ethics, transparency, accountability and market value must be grasped by the algorithm in a series of ever more demanding forms of experimentation. Here the algorithm must prove its ability to get a grip on everyday life if it is to become an ordinary feature of the settings where it is being put to work. Through investigating the everyday life of the algorithm, the book opens a conversation with existing social science research that tends to focus on the power and opacity of algorithms. In this book we have unique access to the algorithm’s design, development and testing, but can also bear witness to its fragility and dependency on others.
The Calculus of Computation : Decision Procedures with Applications to Verification
Computational logic is a fast-growing field with applications in artificial intelligence, constraint solving, and the design and verification of software and hardware systems. Written with graduate and advanced undergraduate students in mind, this textbook introduces computational logic from the foundations of first-order logic to state-of-the-art decision procedures for arithmetic, data structures, and combination theories. This textbook also presents a logical approach to engineering correct software. The increasing ubiquity of computers makes implementing correct systems more important than ever. Verification exercises develop the reader's facility in specifying and verifying software using logic. The treatment of verification concludes with an introduction to the static analysis of software, an important component of modern verification systems.
The Burrows-Wheeler Transform : Data Compression, Suffix Arrays, and Pattern Matching
This book will serve as a reference for seasoned professionals or researchers in the area, while remaining accessible for senior undergraduate students or first year graduate students embarking upon research in compression, pattern matching, full text retrieval, compressed index structures, or other areas related to the BWT.
The Algorithm Design Manual
The reader-friendly Algorithm Design Manual provides straightforward access to combinatorial algorithms technology, stressing design over analysis. The first part, Techniques, provides accessible instruction on methods for designing and analyzing computer algorithms. The second part, Resources, is intended for browsing and reference, and comprises the catalog of algorithmic resources, implementations and an extensive bibliography.
Survey of Text Mining II : Clustering, Classification, and Retrieval
Continues to survey the evolving field of text mining - the application of techniques of machine learning, in conjunction with natural language processing, information extraction and algebraic/mathematical approaches, to computational information retrieval. Numerous diverse issues are addressed, ranging from the development of new learning approaches to novel document clustering algorithms, collectively spanning several major topic areas in text mining.
Structural information and communication complexity ; Vol. 3499 ; 12th International Colloquium, SIROCCO 2005, Mont Saint-Michel, France, May 24-26, 2005, Proceedings
Constitutes the refereed proceedings of the 12th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2005, held in Mont Saint-Michel, France in May 2005. The 22 revised full papers presented were carefully reviewed and selected from 48 submissions. The papers address issues such as topics in distributed and parallel computing, information dissemination, communication complexity, interconnection networks, high speed networks, wireless networking, mobile computing, optical computing, and related areas.
Structural Information and Communication Complexity ; 15th International Colloquium, SIROCCO 2008 Villars-sur-Ollon, Switzerland, June 17-20, 2008 Proceedings
Cover topics such as distributed algorithms, compact data structures, information dissemination, informative labeling schemes, combinatorial optimization, and others, with potential applications to large scale distributed systems including global computing platforms, peer-to-peer systems and applications, social networks, wireless networks, and network protocols (such as routing, broadcasting, localization).
Structural Information and Communication Complexity ; 14th International Colloquium, SIROCCO 2007, Castiglioncello, Italy, June 5-8, 2007, Proceedings
Constitutes the refereed proceedings of the 14th International Colloquium on Structural Information and Communication Complexity, SIROCCO 2007, held in Castiglioncello, Italy in June 2007. This book presents 23 revised full papers together with 4 invited talks that were reviewed and selected from 66 submissions.
