<?xml version="1.0"?>
<rss version="0.92" xml:base="http://www.freebookspot.es">
<channel>
<title>FreeBookSpot Algorithms Latest Books</title>
<link>http://www.freebookspot.es</link>
<description>Latest books added today</description>
<language>en-us</language>
<image>
<title>FreeBookSpot Algorithms </title>
<url>http://www.freebookspot.es/logorss.jpg</url>
<link>http://www.freebookspot.es</link>
<width>160</width>
<height>43</height>
</image>
<item>
<title>Algorithms and Data Structures for External Memory</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=387190</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=387190"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Algorithms_and_Data_Structures_6_4_2013_8_39_19_AM.jpg" align="left" hspace="10" /></a>Product Description
Data sets in large applications are often too massive to fit completely inside the computer's internal memory. The resulting input/output communication (or I/O) between fast internal memory and slower external memory (such as disks) can be a major performance bottleneck. Algorithms and Data Structures for External Memory surveys the state of the art in the design and analysis of external memory (or EM) algorithms and data structures, where the goal is to exploit locality and parallelism in order to reduce the I/O costs. A variety of EM paradigms are considered for solving batched and online problems efficiently in external memory. Algorithms and Data Structures for External Memory describes several useful paradigms for the design and implementation of efficient EM algorithms and data structures. The problem domains considered include sorting, permuting, FFT, scientific computing, computational geometry, graphs, databases, geographic information systems, and text and string processing. Algorithms and Data Structures for External Memory is an invaluable reference for anybody interested in, or conducting research in the design, analysis, and implementation of algorithms and data structures. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=387190"> Read more...</a> <BR>]]></description>
<pubDate>Tue, 04 Jun 2013 08:39:19 GMT</pubDate>
</item>
<item>
<title>Trends in Parsing Technology: Dependency Parsing, Domain Adaptation, and Deep Parsing (Text, Speech and Language Technology)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=387189</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=387189"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Trends_in_Parsing_Technology___6_4_2013_8_37_25_AM.jpg" align="left" hspace="10" /></a>Product Description: Computer parsing technology, which breaks down complex linguistic structures into their constituent parts, is a key research area in the automatic processing of human language. This volume is a collection of contributions from leading researchers in the field of natural language processing technology, each of whom detail their recent work which includes new techniques as well as results. The book presents an overview of the state of the art in current research into parsing technologies, focusing on three important themes: dependency parsing, domain adaptation, and deep parsing. The technology, which has a variety of practical uses, is especially concerned with the methods, tools and software that can be used to parse automatically. Applications include extracting information from free text or speech, question answering, speech recognition and comprehension, recommender systems, machine translation, and automatic summarization. New developments in the area of parsing technology are thus widely applicable, and researchers and professionals from a number of fields will find the material here required reading. As well as the other four volumes on parsing technology in this series this book has a breadth of coverage that makes it suitable both as an overview of the field for graduate students, and as a reference for established researchers in computational linguistics, artificial intelligence, computer science, language engineering, information science, and co <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=387189"> Read more...</a> <BR>]]></description>
<pubDate>Tue, 04 Jun 2013 08:36:57 GMT</pubDate>
</item>
<item>
<title>Ant Colony Optimization (Bradford Books)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=387157</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=387157"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Ant_Colony_Optimization_(Bradf_6_4_2013_7_27_37_AM.jpg" align="left" hspace="10" /></a>Product Description: The complex social behaviors of ants have been much studied by science, and computer scientists are now finding that these behavior patterns can provide models for solving difficult combinatorial optimization problems. The attempt to develop algorithms inspired by one aspect of ant behavior, the ability to find what computer scientists would call shortest paths, has become the field of ant colony optimization (ACO), the most successful and widely recognized algorithmic technique based on ant behavior. This book presents an overview of this rapidly growing field, from its theoretical inception to practical applications, including descriptions of many available ACO algorithms and their uses.  The book first describes the translation of observed ant behavior into working optimization algorithms. The ant colony metaheuristic is then introduced and viewed in the general context of combinatorial optimization. This is followed by a detailed description and guide to all major ACO algorithms and a report on current theoretical findings. The book surveys ACO applications now in use, including routing, assignment, scheduling, subset, machine learning, and bioinformatics problems. AntNet, an ACO algorithm designed for the network routing problem, is described in detail. The authors conclude by summarizing the progress in the field and outlining future research directions. Each chapter ends with bibliographic material, bullet points setting out important ideas covered <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=387157"> Read more...</a> <BR>]]></description>
<pubDate>Tue, 04 Jun 2013 07:27:37 GMT</pubDate>
</item>
<item>
<title>Computer Vision for Human-Machine Interaction</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=387153</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=387153"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Computer_Vision_for_Human-Mach_6_4_2013_6_45_15_AM.jpg" align="left" hspace="10" /></a>Product Description: Recent advances in the field of computer vision are leading to novel and radical changes in the way we interact with computers. It will soon be possible to enable a computer linked to a video camera to detect the presence of users, track faces, arms and hands in real time, and analyze expressions and gestures. The implications for interface design are immense and are expected to have major repercussions for all areas where computers are used, from the work place to recreation. This book collects ideas and algorithms from the world's leading scientists, offering a glimpse of the radical changes around the corner that will alter the way we interact with computers in the near future. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=387153"> Read more...</a> <BR>]]></description>
<pubDate>Tue, 04 Jun 2013 06:45:15 GMT</pubDate>
</item>
<item>
<title>Connected Dominating Set: Theory and Applications</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=386842</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386842"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Connected_Dominating_Set__Theo_6_3_2013_10_31_10_AM.jpg" align="left" hspace="10" /></a>The connected dominating set has been a classic subject studied in graph theory since 1975. Since the 1990s, it has been found to have important applications in communication networks, especially in wireless networks, as a virtual backbone. Motivated from those applications, many papers have been published in the literature during last 15 years. Now, the connected dominating set has become a hot research topic in computer science. In this book, we are going to collect recent developments on the connected dominating set, which presents the state of the art in the study of connected dominating sets. The book consists of 16 chapters. Except the 1st one, each chapter is devoted to one problem, and consists of three parts, motivation and overview, problem complexity analysis, and approximation algorithm designs, which will lead the reader to see clearly about the background, formulation, existing important research results, and open problems. Therefore, this would be a very valuable reference book for researchers in computer science and operations research, especially in areas of theoretical computer science, computer communication networks, combinatorial optimization, and discrete mathematics.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386842"> Read more...</a> <BR>]]></description>
<pubDate>Mon, 03 Jun 2013 10:31:10 GMT</pubDate>
</item>
<item>
<title>Data Correcting Approaches in Combinatorial Optimization</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=386840</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386840"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Data_Correcting_Approaches_in__6_3_2013_10_18_37_AM.jpg" align="left" hspace="10" /></a>Data Correcting Approaches in Combinatorial Optimization focuses on algorithmic applications of the well known polynomially solvable special cases of computationally intractable problems. The purpose of this text is to design practically efficient algorithms for solving wide classes of combinatorial optimization problems.  Researches, students and engineers will benefit from new bounds and branching rules in development efficient branch-and-bound type computational algorithms. This book examines applications for solving the Traveling Salesman Problem and its variations, Maximum Weight Independent Set Problem, Different Classes of Allocation and Cluster Analysis  as well as some classes of Scheduling Problems. Data Correcting Algorithms in Combinatorial Optimization  introduces the data correcting approach to algorithms which provide an answer to the following questions: how to construct a bound to the original intractable problem and find which element of the corrected instance  one should branch such that the total size of search tree will be minimized. The PC time needed for solving intractable problems will be adjusted with the requirements for solving real world problems.?
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386840"> Read more...</a> <BR>]]></description>
<pubDate>Mon, 03 Jun 2013 10:18:37 GMT</pubDate>
</item>
<item>
<title>Multidimensional Data Visualization: Methods and Applications</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=386731</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386731"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Multidimensional_Data_Visualiz_6_2_2013_9_55_18_PM.jpg" align="left" hspace="10" /></a>This book highlights recent developments in multidimensional data visualization, presenting both new methods and modifications on classic techniques. Throughout the book, various  applications of multidimensional data visualization are presented including its uses in social sciences (economy, education, politics, psychology), environmetrics, and medicine (ophthalmology, sport medicine, pharmacology, sleep medicine). The book provides recent research results in optimization-based visualization. Evolutionary algorithms and a two-level optimization method, based on combinatorial optimization and quadratic programming, are analyzed in detail. The performance of these algorithms and the development of parallel versions are discussed. The utilization of new visualization techniques to improve the capabilies of artificial neural networks (self-organizing maps, feed-forward networks) is also discussed. The book includes over 100 detailed images presenting examples of the many different visualization techniques that the book presents. This book is intended for scientists and researchers in any field of study where complex and multidimensional data must be represented visually.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386731"> Read more...</a> <BR>]]></description>
<pubDate>Sun, 02 Jun 2013 21:55:18 GMT</pubDate>
</item>
<item>
<title>Robust Data Mining</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=386729</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386729"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Robust_Data_Mining_6_2_2013_9_46_37_PM.jpg" align="left" hspace="10" /></a>Data uncertainty is a concept closely related with most real life applications that involve data collection and interpretation. Examples can be found in data acquired with biomedical instruments or other experimental techniques. Integration of robust optimization in the existing data mining techniques aim to create new algorithms resilient to error and noise. This work encapsulates all the latest applications of robust optimization in data mining. This brief contains an overview of the rapidly growing field of robust data mining research field and presents  the most well known machine learning algorithms, their robust counterpart formulations and algorithms for attacking these problems. This brief will appeal to theoreticians and data miners working in this field.

 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386729"> Read more...</a> <BR>]]></description>
<pubDate>Sun, 02 Jun 2013 21:46:37 GMT</pubDate>
</item>
<item>
<title>A Proof Theory for Description Logics</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=386726</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386726"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/A_Proof_Theory_for_Description_6_2_2013_9_38_38_PM.jpg" align="left" hspace="10" /></a>Description Logics (DLs) is a family of formalisms used to represent knowledge of a domain. They are equipped with a formal logic-based semantics. Knowledge representation systems based on description logics provide various inference capabilities that deduce implicit knowledge from the explicitly represented knowledge. A Proof Theory for Description Logics introduces Sequent Calculi and Natural Deduction for some DLs (ALC, ALCQ). Cut-elimination and Normalization are proved for the calculi. The author argues that such systems can improve the extraction of computational content from DLs proofs for explanation purposes.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386726"> Read more...</a> <BR>]]></description>
<pubDate>Sun, 02 Jun 2013 21:38:38 GMT</pubDate>
</item>
<item>
<title>Discrete-Event Modeling and Simulation: Theory and Applications (Computational Analysis, Synthesis, and Design of Dynamic Systems)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=386336</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386336"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Discrete-Event_Modeling_and_Si_6_1_2013_9_44_40_PM.jpeg" align="left" hspace="10" /></a>Product Description: 

Collecting the work of the foremost scientists in the field, Discrete-Event Modeling and Simulation: Theory and Applications presents the state of the art in modeling discrete-event systems using the discrete-event system specification (DEVS) approach. It introduces the latest advances, recent extensions of formal techniques, and real-world examples of various applications. 

The book covers many topics that pertain to several layers of the modeling and simulation architecture. It discusses DEVS model development support and the interaction of DEVS with other methodologies. It describes different forms of simulation supported by DEVS, the use of real-time DEVS simulation, the relationship between DEVS and graph transformation, the influence of DEVS variants on simulation performance, and interoperability and composability with emphasis on DEVS standardization. The text also examines extensions to DEVS, new formalisms, and abstractions of DEVS models as well as the theory and analysis behind real-world system identification and control. To support the generation and search of optimal models of a system, a framework is developed based on the system entity structure and its transformation to DEVS simulation models. In addition, the book explores numerous interesting examples that illustrate the use of DEVS to build successful applications, including optical network-on-chip, construction/building design, process control, workflow systems, and environmen <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386336"> Read more...</a> <BR>]]></description>
<pubDate>Sat, 01 Jun 2013 21:44:41 GMT</pubDate>
</item>
<item>
<title>Computational Intelligence in Image Processing</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=386215</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386215"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Computational_Intelligence_in__6_1_2013_2_13_32_PM.jpg" align="left" hspace="10" /></a>Computational intelligence based techniques have firmly established themselves as viable, alternate, mathematical tools for more than a decade. They have been extensively employed in many systems and application domains, among these signal processing, automatic control, industrial and consumer electronics, robotics, finance, manufacturing systems, electric power systems, and power electronics. Image processing is also an extremely potent area which has attracted the attention of many researchers who are interested in the development of new computational intelligence-based techniques and their suitable applications, in both research problems and in real-world problems. Part I of the book discusses several image preprocessing algorithms  Part II broadly covers image compression algorithms  Part III demonstrates how computational intelligence-based techniques can be effectively utilized for image analysis purposes  and Part IV shows how pattern recognition, classification and clustering-based techniques can be developed for the purpose of image inferencing. The book offers a unified view of the modern computational intelligence techniques required to solve real-world problems and it is suitable as a reference for engineers, researchers and graduate students.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386215"> Read more...</a> <BR>]]></description>
<pubDate>Sat, 01 Jun 2013 14:13:32 GMT</pubDate>
</item>
<item>
<title>Space-Filling Curves: An Introduction with Applications in Scientific Computing</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=386127</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386127"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Space-Filling_Curves__An_Intro_6_1_2013_11_00_13_AM.jpg" align="left" hspace="10" /></a>The present book provides an introduction to using space-filling curves (SFC) as tools in scientific computing. Special focus is laid on the representation of SFC and on resulting algorithms. For example, grammar-based techniques are introduced for traversals of Cartesian and octree-type meshes, and arithmetisation of SFC is explained to compute SFC mappings and indexings.  The locality properties of SFC are discussed in detail, together with their importance for algorithms. Templates for parallelisation and cache-efficient algorithms are presented to reflect the most important applications of SFC in scientific computing. Special attention is also given to the interplay of adaptive mesh refinement and SFC, including the structured refinement of triangular and tetrahedral grids. For each topic, a short overview is given on the most important publications and recent research activities.

 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386127"> Read more...</a> <BR>]]></description>
<pubDate>Sat, 01 Jun 2013 11:00:13 GMT</pubDate>
</item>
<item>
<title>Sparse Grids and Applications</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=386032</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386032"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Sparse_Grids_and_Applications_6_1_2013_12_04_15_AM.jpg" align="left" hspace="10" /></a>In the recent decade, there has been a growing interest in the numerical treatment of high-dimensional problems. It is well known that classical numerical discretization schemes fail in more than three or four dimensions due to the curse of dimensionality. The technique of sparse grids helps overcome this problem to some extent under suitable regularity assumptions. This discretization approach is obtained from a multi-scale basis by a tensor product construction and subsequent truncation of the resulting multiresolution series expansion. This volume of LNCSE is a collection of the papers from the proceedings of the workshop on sparse grids and its applications held in Bonn in May 2011. The selected articles present recent advances in the mathematical understanding and analysis of sparse grid discretization. Aspects arising from applications are given particular attention.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386032"> Read more...</a> <BR>]]></description>
<pubDate>Sat, 01 Jun 2013 00:04:15 GMT</pubDate>
</item>
<item>
<title>Foundations of Geometric Algebra Computing</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=386029</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386029"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Foundations_of_Geometric_Algeb_5_31_2013_11_57_19_PM.jpg" align="left" hspace="10" /></a>The author defines “Geometric Algebra Computing” as the geometrically intuitive development of algorithms using geometric algebra with a focus on their efficient implementation, and the goal of this book is to lay the foundations for the widespread use of geometric algebra as a powerful, intuitive mathematical language for engineering applications in academia and industry. The related technology is driven by the invention of conformal geometric algebra as a 5D extension of the 4D projective geometric algebra and by the recent progress in parallel processing, and with the specific conformal geometric algebra there is a growing community in recent years applying geometric algebra to applications in computer vision, computer graphics, and robotics. This book is organized into three parts: in Part I the author focuses on the mathematical foundations  in Part II he explains the interactive handling of geometric algebra  and in Part III he deals with computing technology for high-performance implementations based on geometric algebra as a domain-specific language in standard programming languages such as C++ and OpenCL. The book is written in a tutorial style and readers should gain experience with the associated freely available software packages and applications. The book is suitable for students, engineers, and researchers in computer science, computational engineering, and mathematics.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=386029"> Read more...</a> <BR>]]></description>
<pubDate>Fri, 31 May 2013 23:57:19 GMT</pubDate>
</item>
<item>
<title>Digital Geometry Algorithms: Theoretical Foundations and Applications to Computational Imaging</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=385338</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=385338"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Digital_Geometry_Algorithms__T_5_29_2013_11_53_57_PM.jpg" align="left" hspace="10" /></a>Digital geometry emerged as an independent discipline in the second half of the last century. It deals with geometric properties of digital objects and is developed with the unambiguous goal to provide rigorous theoretical foundations for devising new advanced approaches and algorithms for various problems of visual computing. Different aspects of digital geometry have been addressed in the literature. This book is the first one that explicitly focuses on the presentation of the most important digital geometry algorithms. Each chapter provides a brief survey on a major research area related to the general volume theme, description and analysis of related fundamental algorithms, as well as new original contributions by the authors. Every chapter contains a section in which interesting open problems are addressed. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=385338"> Read more...</a> <BR>]]></description>
<pubDate>Wed, 29 May 2013 23:53:57 GMT</pubDate>
</item>
<item>
<title>Image-Based Geometric Modeling and Mesh Generation</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=385337</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=385337"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Image-Based_Geometric_Modeling_5_29_2013_11_51_13_PM.jpg" align="left" hspace="10" /></a>As a new interdisciplinary research area, “image-based geometric modeling and mesh generation” integrates image processing, geometric modeling and mesh generation with finite element method (FEM) to solve problems in computational biomedicine, materials sciences and engineering. It is well known that FEM is currently well-developed and efficient, but mesh generation for complex geometries (e.g., the human body) still takes about 80% of the total analysis time and is the major obstacle to reduce the total computation time. It is mainly because none of the traditional approaches is sufficient to effectively construct finite element meshes for arbitrarily complicated domains, and generally a great deal of manual interaction is involved in mesh generation. This contributed volume, the first for such an interdisciplinary topic, collects the latest research by experts in this area. These papers cover a broad range of topics, including medical imaging, image alignment and segmentation, image-to-mesh conversion, quality improvement, mesh warping, heterogeneous materials, biomodelcular modeling and simulation, as well as medical and engineering applications. This contributed volume, the first for such an interdisciplinary topic, collects the latest research by experts in this area. These papers cover a broad range of topics, including medical imaging, image alignment and segmentation, image-to-mesh conversion, quality improvement, mesh warping, heterogeneous materials, biomodelcular m <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=385337"> Read more...</a> <BR>]]></description>
<pubDate>Wed, 29 May 2013 23:51:13 GMT</pubDate>
</item>
<item>
<title>Bisociative Knowledge Discovery An Introduction to Concept, Algorithms, Tools, and Applications (Lecture Notes in Computer Science / Lecture Notes in Artificial Intelligence)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=384283</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=384283"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Bisociative_Knowledge_Discover_5_26_2013_7_19_48_PM.jpg" align="left" hspace="10" /></a>Modern knowledge discovery methods enable users to discover complex patterns of various types in large information repositories. However, the underlying assumption has always been that the data to which the methods are applied to originates from one domain. The focus of this book, and the BISON project from which the contributions are originating, is a network based integration of various types of data repositories and the development of new ways to analyse and explore the resulting gigantic information networks. Instead of finding well defined global or local patterns they wanted to find domain bridging associations which are, by definition, not well defined since they will be especially interesting if they are sparse and have not been encountered before. The 32 contributions presented in this state-of-the-art volume together with a detailed introduction to the book are organized in topical sections on bisociation  representation and network creation  network analysis  exploration  and applications and evaluation. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=384283"> Read more...</a> <BR>]]></description>
<pubDate>Sun, 26 May 2013 19:19:48 GMT</pubDate>
</item>
<item>
<title>Algorithms in C++, Parts 1-4: Fundamentals, Data Structure, Sorting, Searching, Third Edition</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=383884</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=383884"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Algorithms_in_C__Parts_1-4___5_24_2013_8_15_56_PM.jpeg" align="left" hspace="10" /></a>Robert Sedgewick has thoroughly rewritten and substantially expanded andupdated his popular work to provide current and comprehensive coverage ofimportant algorithms and data structures. Christopher Van Wyk and Sedgewickhave developed new C++ implementations that both express the methods in aconcise and direct manner, and also provide programmers with the practicalmeans to test them on real applications. Many new algorithms are presented, and the explanations of each algorithmare much more detailed than in previous editions. A new text design anddetailed, innovative figures, with accompanying commentary, greatly enhancethe presentation. The third edition retains the successful blend of theory andpractice that has made Sedgewick's work an invaluable resource for more than250,000 programmers! This particular book, Parts 1-4, represents the essential first half of Sedgewick'scomplete work. It provides extensive coverage of fundamental data structuresand algorithms for sorting, searching, and related applications. Although thesubstance of the book applies to programming in any language, theimplementations by Van Wyk and Sedgewick also exploit the natural matchbetween 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 so <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=383884"> Read more...</a> <BR>]]></description>
<pubDate>Fri, 24 May 2013 20:15:57 GMT</pubDate>
</item>
<item>
<title>The Design and Analysis of Algorithms (Monographs in Computer Science)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=383695</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=383695"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/The_Design_and_Analysis_of_Alg_5_24_2013_1_25_45_PM.jpeg" align="left" hspace="10" /></a>The design and analysis of algorithms is one of the two essential cornerstone topics in computer science (the other being automata theory/theory of computation). Every computer scientist has a copy of Knuth's works on algorithms on his or her shelf. Dexter Kozen, a researcher and professor at Cornell University, has written a text for graduate study of algorithms. This will be an important reference book as well as being a useful graduate-level textbook.

 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=383695"> Read more...</a> <BR>]]></description>
<pubDate>Fri, 24 May 2013 13:25:45 GMT</pubDate>
</item>
<item>
<title>Handbook of Data Structures and Applications (Chapman <![CDATA[&]]> Hall/CRC Computer <![CDATA[&]]> Information Science Series)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=383653</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=383653"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Handbook_of_Data_Structures_an_5_24_2013_12_19_47_PM.jpeg" align="left" hspace="10" /></a>Although there are many advanced and specialized texts and handbooks on algorithms, until now there was no book that focused exclusively on the wide variety of data structures that have been reported in the literature. The Handbook of Data Structures and Applications responds to the needs of students, professionals, and researchers who need a mainstream reference on data structures by providing a comprehensive survey of data structures of various types.

 Divided into seven parts, the text begins with a review of introductory material, followed by a discussion of well-known classes of data structures, Priority Queues, Dictionary Structures, and Multidimensional structures. The editors next analyze miscellaneous data structures, which are well-known structures that elude easy classification. The book then addresses mechanisms and tools that were developed to facilitate the use of data structures in real programs. It concludes with an examination of the applications of data structures.

 The Handbook is invaluable in suggesting new ideas for research in data structures, and for revealing application contexts in which they can be deployed. Practitioners devising algorithms will gain insight into organizing data, allowing them to solve algorithmic problems more efficiently. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=383653"> Read more...</a> <BR>]]></description>
<pubDate>Fri, 24 May 2013 12:19:47 GMT</pubDate>
</item>
<item>
<title>The Golden Ticket: P, NP, and the Search for the Impossible</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=382972</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=382972"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/The_Golden_Ticket__P__NP__and__5_22_2013_6_50_18_PM.jpg" align="left" hspace="10" /></a>The P-NP problem is the most important open problem in computer science, if not all of mathematics. The Golden Ticket provides a nontechnical introduction to P-NP, its rich history, and its algorithmic implications for everything we do with computers and beyond. In this informative and entertaining book, Lance Fortnow traces how the problem arose during the Cold War on both sides of the Iron Curtain, and gives examples of the problem from a variety of disciplines, including economics, physics, and biology. He explores problems that capture the full difficulty of the P-NP dilemma, from discovering the shortest route through all the rides at Disney World to finding large groups of friends on Facebook. But difficulty also has its advantages. Hard problems allow us to safely conduct electronic commerce and maintain privacy in our online lives.
The Golden Ticket explores what we truly can and cannot achieve computationally, describing the benefits and unexpected challenges of the P-NP problem. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=382972"> Read more...</a> <BR>]]></description>
<pubDate>Wed, 22 May 2013 18:50:18 GMT</pubDate>
</item>
<item>
<title>Advanced Animation and Rendering Techniques: Theory and Practice</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=382562</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=382562"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Advanced_Animation_and_Renderi_5_21_2013_11_21_47_PM.jpg" align="left" hspace="10" /></a>An exposition of state-of-the-art techniques in rendering and animation. This book provides a unique synthesis of techniques and theory. Each technique is illustrated with a series of full-color frames showing the development of the example. 

[b]Features [/b]
[list][*]contains a wealth of practical implementation detail includes practical algorithms backed up by details of their implementation using RenderMan 
[*]all animation techniques based around real case studies of commercially produced work 
[*]includes 36 pages of color images 
[/list]Advanced Animation and Rendering Techniquesoffers a balance between theoretical concepts and implementational detail that will be invaluable to professional programmers and students alike. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=382562"> Read more...</a> <BR>]]></description>
<pubDate>Tue, 21 May 2013 23:21:47 GMT</pubDate>
</item>
<item>
<title>Theoretische Informatik: Formale Sprachen, Berechenbarkeit, Komplexitatstheorie, Algorithmik, Kommunikation und Kryptographie [German]</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=381540</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=381540"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Theoretische_Informatik__Forma_5_19_2013_8_16_01_AM.jpeg" align="left" hspace="10" /></a> Die Zielsetzung dieses Lehrbuchs besteht darin, auf leicht verstandliche Art in die grundlegenden algorithmischen Konzepte der Informatik einzufuhren. Die Konzepte werden in ihrer historischen Entwicklung und in gro?eren Zusammenhangen dargestellt, um so die eigentliche Faszination der Informatik, die viel kontraintuitive Uberraschungen bereithalt, zu wecken.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=381540"> Read more...</a> <BR>]]></description>
<pubDate>Sun, 19 May 2013 08:16:01 GMT</pubDate>
</item>
<item>
<title>Scalable Input/Output: Achieving System Balance (Scientific and Engineering Computation)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=381338</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=381338"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Scalable_Input_Output__Achievi_5_18_2013_3_09_25_PM.jpg" align="left" hspace="10" /></a>As we enter the "decade of data," the disparity between the vast amount of data storage capacity (measurable in terabytes and petabytes) and the bandwidth available for accessing it has created an input/output bottleneck that is proving to be a major constraint on the effective use of scientific data for research. Scalable Input/Output is a summary of the major research results of the Scalable I/O Initiative, launched by Paul Messina, then Director of the Center for Advanced Computing Research at the California Institute of Technology, to explore software and algorithmic solutions to the I/O imbalance. The contributors explore techniques for I/O optimization, including: I/O characterization to understand application and system I/O patterns  system checkpointing strategies  collective I/O and parallel database support for scientific applications  parallel I/O libraries and strategies for file striping, prefetching, and write behind  compilation strategies for out-of-core data access  scheduling and shared virtual memory alternatives  network support for low-latency data transfer  and parallel I/O application programming interfaces. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=381338"> Read more...</a> <BR>]]></description>
<pubDate>Sat, 18 May 2013 15:09:25 GMT</pubDate>
</item>
<item>
<title>Neural Networks for Pattern Recognition</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=381319</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=381319"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Neural_Networks_for_Pattern_Re_5_18_2013_2_39_34_PM.jpg" align="left" hspace="10" /></a>Neural Networks for Pattern Recognition takes the pioneering work in artificial neural networks by Stephen Grossberg and his colleagues to a new level. In a simple and accessible way it extends embedding field theory into areas of machine intelligence that have not been clearly dealt with before. Following a tutorial of existing neural networks for pattern classification, Nigrin expands on these networks to present fundamentally new architectures that perform realtime pattern classification of embedded and synonymous patterns and that will aid in tasks such as vision, speech recognition, sensor fusion, and constraint satisfaction.Nigrin presents the new architectures in two stages. First he presents a network called Sonnet 1 that already achieves important properties such as the ability to learn and segment continuously varied input patterns in real time, to process patterns in a context sensitive fashion, and to learn new patterns without degrading existing categories. He then removes simplifications inherent in Sonnet 1 and introduces radically new architectures. These architectures have the power to classify patterns that may have similar meanings but that have different external appearances (synonyms). They also have been designed to represent patterns in a distributed fashion, both in short-term and long-term memory.Albert Nigrin is Assistant Professor in the Department of Computer Science and Information Systems at American University. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=381319"> Read more...</a> <BR>]]></description>
<pubDate>Sat, 18 May 2013 14:39:34 GMT</pubDate>
</item>
<item>
<title>Resource-Aware Data Fusion Algorithms for Wireless Sensor Networks (Lecture Notes in Electrical Engineering)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=381093</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=381093"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Resource-Aware_Data_Fusion_Alg_5_17_2013_8_12_46_PM.jpeg" align="left" hspace="10" /></a>This book introduces resource-aware data fusion algorithms to gather and combine data from multiple sources (e.g., sensors) in order to achieve inferences. These techniques can be used in centralized and distributed systems to overcome sensor failure, technological limitation, and spatial and temporal coverage problems. The algorithms described in this book are evaluated with simulation and experimental results to show they will maintain data integrity and make data useful and informative. Describes techniques to overcome real problems posed by wireless sensor networks deployed in circumstances that might interfere with measurements provided, such as strong variations of pressure, temperature, radiation, and electromagnetic noise  Uses simulation and experimental results to evaluate algorithms presented and includes real test-bed Includes case study implementing data fusion algorithms on a remote monitoring framework for sand production in oil pipelines. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=381093"> Read more...</a> <BR>]]></description>
<pubDate>Fri, 17 May 2013 20:12:46 GMT</pubDate>
</item>
<item>
<title>Matrix Methods in Data Mining and Pattern Recognition (Fundamentals of Algorithms)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=380820</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380820"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Matrix_Methods_in_Data_Mining__5_16_2013_11_37_34_PM.jpeg" align="left" hspace="10" /></a>Several very powerful numerical linear algebra techniques are available for solving problems in data mining and pattern recognition. This application-oriented book describes how modern matrix methods can be used to solve these problems, gives an introduction to matrix theory and decompositions, and provides students with a set of tools that can be modified for a particular application. Matrix Methods in Data Mining and Pattern Recognition is divided into three parts. Part I gives a short introduction to a few application areas before presenting linear algebra concepts and matrix decompositions that students can use in problem-solving environments such as MATLABA®. Some mathematical proofs that emphasize the existence and properties of the matrix decompositions are included. In Part II, linear algebra techniques are applied to data mining problems. Part III is a brief introduction to eigenvalue and singular value algorithms. The applications discussed by the author are: classification of handwritten digits, text mining, text summarization, pagerank computations related to the GoogleA” search engine, and face recognition. Exercises and computer assignments are available on a Web page that supplements the book. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380820"> Read more...</a> <BR>]]></description>
<pubDate>Thu, 16 May 2013 23:37:34 GMT</pubDate>
</item>
<item>
<title>Variable-length Codes for Data Compression</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=380805</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380805"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Variable-length_Codes_for_Data_5_16_2013_11_22_55_PM.jpeg" align="left" hspace="10" /></a>Most data compression methods that are based on variable-length codes employ the Huffman or Golomb codes. However, there are a large number of less-known codes that have useful properties and these can be useful. This book brings this large set of codes to the attention of workers in the field and for students of computer science. The author’s crystal clear style of writing and presentation allows easy access to the topic. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380805"> Read more...</a> <BR>]]></description>
<pubDate>Thu, 16 May 2013 23:22:55 GMT</pubDate>
</item>
<item>
<title>Memory Management: Algorithms and Implementations in C/C++ (Windows Programming/Development)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=380802</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380802"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Memory_Management__Algorithms__5_16_2013_11_16_46_PM.jpeg" align="left" hspace="10" /></a>Memory Management: Algorithms and Implementation in C/C++ describes how to construct production-quality memory managers. This approach includes both high-performance explicit memory managers and more intricate garbage collectors like those popularized by the Java Virtual Machine. Every implementation is complemented by an in-depth presentation of theory, benchmark tests, extensive source code examples, and a discussion of each implementation's trade-offs. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380802"> Read more...</a> <BR>]]></description>
<pubDate>Thu, 16 May 2013 23:16:46 GMT</pubDate>
</item>
<item>
<title>Computer Arithmetic: Algorithms and Hardware Designs</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=380801</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380801"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Computer_Arithmetic__Algorithm_5_16_2013_11_11_21_PM.jpeg" align="left" hspace="10" /></a>The field of digital computer architecture has grown explosively in the past two decades. Through a steady stream of experimental research, tool-building efforts, and theoretical studies, the design of an instruction-set architecture has been transformed into one of the most quantitative branches of computer technology. However, this explosive growth has led to unprecedented harware complexity and almost intolerable development costs. The challenge faxing current and future computer designers is to institute simplicity where we now have complexity  to use fundamental theories being developed in this area to gain performance and ease-of-use benefits from simpler circuits  to understand the interplay between technological capabilities/limitations and sound architectural decisions. Computer arithmetic plays a key role in the computer designers' quest for user-friendliness, compactness, simplicity, high performance, low cost, and low power. Parhami's Computer Architecture emphasizes both the underlying theory and actual hardware designs. and links computer arithmetic to other subfields of computing. It is the first computer arithmetic book to cover all topics important for a balanced and complete view of the field. IT will be accompanied by an instructor's manual, with problem solutions and enlarged versions of the figures/charts, suitable for reproduction as transparencies. This is a textbook for senior/graduate level courses in departments of computer science and electrical and <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380801"> Read more...</a> <BR>]]></description>
<pubDate>Thu, 16 May 2013 23:11:21 GMT</pubDate>
</item>
<item>
<title>Handbook of Exact String Matching Algorithms</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=380800</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380800"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Handbook_of_Exact_String_Match_5_16_2013_11_07_35_PM.jpeg" align="left" hspace="10" /></a>String matching is a very important subject in the wider domain of text processing. It consists of finding one,or more generally, all the occurrences of a string (more generally called a pattern) in a text. The Handbook of Exact String Matching Algorithms presents 38 methods for solving this problem. For each, it gives the main features, a description, its C code, an example and references. 
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380800"> Read more...</a> <BR>]]></description>
<pubDate>Thu, 16 May 2013 23:07:35 GMT</pubDate>
</item>
<item>
<title>Matrix Algorithms, Volume II: Eigensystems</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=380799</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380799"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Matrix_Algorithms__Volume_II___5_16_2013_11_04_23_PM.jpeg" align="left" hspace="10" /></a>This is the second volume in a projected five-volume survey of numerical linear algebra and matrix algorithms. It treats the numerical solution of dense and large-scale eigenvalue problems with an emphasis on algorithms and the theoretical background required to understand them. The notes and reference sections contain pointers to other methods along with historical comments. The book is divided into two parts: dense eigenproblems and large eigenproblems. The first part gives a full treatment of the widely used QR algorithm, which is then applied to the solution of generalized eigenproblems and the computation of the singular value decomposition. The second part treats Krylov sequence methods such as the Lanczos and Arnoldi algorithms and presents a new treatment of the Jacobi-Davidson method. These volumes are not intended to be encyclopedic, but provide the reader with the theoretical and practical background to read the research literature and implement or modify new algorithms.

Thanks to the original uploader! <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380799"> Read more...</a> <BR>]]></description>
<pubDate>Thu, 16 May 2013 23:04:23 GMT</pubDate>
</item>
<item>
<title>Finite-State Language Processing</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=380552</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380552"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Finite-State_Language_Processi_5_16_2013_2_24_51_PM.jpg" align="left" hspace="10" /></a>Finite-state devices, which include finite-state automata, graphs, and finite-state transducers, are in wide use in many areas of computer science. Recently, there has been a resurgence of the use of finite-state devices in all aspects of computational linguistics, including dictionary encoding, text processing, and speech processing. This book describes the fundamental properties of finite-state devices and illustrates their uses. Many of the contributors pioneered the use of finite-automata for different aspects of natural language processing. The topics, which range from the theoretical to the applied, include finite-state morphology, approximation of phrase-structure grammars, deterministic part-of-speech tagging, application of a finite-state intersection grammar, a finite-state transducer for extracting information from text, and speech recognition using weighted finite automata. The introduction presents the basic theoretical results in finite-state automata and transducers. These results and algorithms are described and illustrated with simple formal language examples as well as natural language examples. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380552"> Read more...</a> <BR>]]></description>
<pubDate>Thu, 16 May 2013 14:24:52 GMT</pubDate>
</item>
<item>
<title>An Introduction to the Analysis of Algorithms</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=380264</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380264"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/An_Introduction_to_the_Analysi_5_15_2013_6_42_23_PM.jpeg" align="left" hspace="10" /></a>Product Description: This book is a thorough overview of the primary techniques and models used in the mathematical analysis of algorithms. The first half of the book draws upon classical mathematical material from discrete mathematics, elementary real analysis, and combinatorics  the second half discusses properties of discrete structures and covers the analysis of a variety of classical sorting, searching, and string processing algorithms. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380264"> Read more...</a> <BR>]]></description>
<pubDate>Wed, 15 May 2013 18:42:23 GMT</pubDate>
</item>
<item>
<title>Algorithmic Foundations of Robotics VIII</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=380235</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380235"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Algorithmic_Foundations_of_Rob_5_15_2013_4_15_21_PM.jpg" align="left" hspace="10" /></a>This volume is the outcome of the eighth edition of the biennial Workshop Algorithmic Foundations of Robotics (WAFR). Edited by G. Chirikjian, H. Choset, M. Morales and T. Murphey, the book offers a collection of a wide range of topics in advanced robotics, including networked robots, distributed systems, manipulation, planning under uncertainty, minimalism, geometric sensing, geometric computation, stochastic planning methods, and medical applications.

The contents of the forty-two contributions represent a cross-section of the current state of research from one particular aspect: algorithms, and how they are inspired by classical disciplines, such as discrete and computational geometry, differential geometry, mechanics, optimization, operations research, computer science, probability and statistics, and information theory. Validation of algorithms, design concepts, or techniques is the common thread running through this focused collection. Rich in topics and authoritative contributors,WAFR culminates with this unique reference on the current developments and new directions in the field of algorithmic foundations. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=380235"> Read more...</a> <BR>]]></description>
<pubDate>Wed, 15 May 2013 16:11:45 GMT</pubDate>
</item>
<item>
<title>Algorithms in C (Computer Science Series)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=379283</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=379283"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Algorithms_in_C_(Computer_Scie_5_13_2013_8_58_56_AM.jpeg" align="left" hspace="10" /></a>Algorithms in C is a comprehensive repository of algorithms, complete with code. If you're in a pinch and need to code something up fast, this book is the place to look. Starting with basic data structures, Algorithms in C covers an enormous scope of information, with extensive treatment of searching and advanced data structures, sorting, string processing, computational geometry, graph problems, and mathematical algorithms. Although the manual often neglects to provide rigorous analysis, the text surrounding the algorithms provides clear and relevant insight into why the algorithms work. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=379283"> Read more...</a> <BR>]]></description>
<pubDate>Mon, 13 May 2013 08:59:09 GMT</pubDate>
</item>
<item>
<title>Matrix Algorithms: Volume 1, Basic Decompositions</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=378857</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378857"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Matrix_Algorithms__Volume_1__B_5_11_2013_11_27_05_PM.jpeg" align="left" hspace="10" /></a>Product Description: This thorough, concise, and superbly written volume is the first in a self-contained five-volume series devoted to matrix algorithms. It focuses on the computation of matrix decompositions - the factorization of matrices into products of similar ones. The first two chapters provide the required background from mathematics and computer science needed to work effectively in matrix computations. The remaining chapters are devoted to the computation and applications of the LU and QR decompositions. The series is aimed at the nonspecialist who needs more than black-box proficiency with matrix computations. A certain knowledge of elementary analysis and linear algebra is assumed, as well as a reasonable amount of programming experience. The guiding principle, that if something is worth explaining, it is worth explaining fully, has necessarily restricted the scope of the series, but the selection of topics should give the reader a sound basis for further study. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378857"> Read more...</a> <BR>]]></description>
<pubDate>Sat, 11 May 2013 23:27:05 GMT</pubDate>
</item>
<item>
<title>Parallel Iterative Algorithms: From Sequential to Grid Computing</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=378692</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378692"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Parallel_Iterative_Algorithms__5_11_2013_11_25_02_AM.jpg" align="left" hspace="10" /></a> Product Description
Focusing on grid computing and asynchronism, Parallel Iterative Algorithms explores the theoretical and practical aspects of parallel numerical algorithms. Each chapter contains a theoretical discussion of the topic, an algorithmic section that fully details implementation examples and specific algorithms, and an evaluation of the advantages and drawbacks of the algorithms. Several exercises also appear at the end of most chapters. The first two chapters introduce the general features of sequential iterative algorithms and their applications to numerical problems. The book then describes different kinds of parallel systems and parallel iterative algorithms. It goes on to address both linear and nonlinear parallel synchronous and asynchronous iterative algorithms for numerical computation, with an emphasis on the multisplitting approach. The final chapter discusses the features required for efficient implementation of asynchronous iterative algorithms. Providing the theoretical and practical knowledge needed to design and implement efficient parallel iterative algorithms, this book illustrates how to apply these algorithms to solve linear and nonlinear numerical problems in parallel environments, including local, distant, homogeneous, and heterogeneous clusters.
Product Details

    * Hardcover: 240 pages
    * Publisher: Chapman  and  Hall/CRC (November 28, 2007)
    * Language: English
    * ISBN-10: 1584888083
    * ISBN-13: 978-1584888086 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378692"> Read more...</a> <BR>]]></description>
<pubDate>Sat, 11 May 2013 11:25:02 GMT</pubDate>
</item>
<item>
<title>Anticipatory Optimization for Dynamic Decision Making (Operations Research/Computer Science Interfaces Series)</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=378501</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378501"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Anticipatory_Optimization_for__5_10_2013_4_56_22_PM.jpg" align="left" hspace="10" /></a>The availability of today’s online information systems rapidly increases the relevance of dynamic decision making within a large number of operational contexts. Whenever a sequence of interdependent decisions occurs, making a single decision raises the need for anticipation of its future impact on the entire decision process. Anticipatory support is needed for a broad variety of dynamic and stochastic decision problems from different operational contexts such as finance, energy management, manufacturing and transportation. Example problems include asset allocation, feed-in of electricity produced by wind power as well as scheduling and routing. All these problems entail a sequence of decisions contributing to an overall goal and taking place in the course of a certain period of time. Each of the decisions is derived by solution of an optimization problem. As a consequence a stochastic and dynamic decision problem resolves into a series of optimization problems to be formulated and solved by anticipation of the remaining decision process.
However, actually solving a dynamic decision problem by means of approximate dynamic programming still is a major scientific challenge. Most of the work done so far is devoted to problems allowing for formulation of the underlying optimization problems as linear programs. Problem domains like scheduling and routing, where linear programming typically does not produce a significant benefit for problem solving, have not been considered so far. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378501"> Read more...</a> <BR>]]></description>
<pubDate>Fri, 10 May 2013 16:56:22 GMT</pubDate>
</item>
<item>
<title>Fundamentals of Matrix Computations, 3rd edition</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=378452</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378452"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Fundamentals_of_Matrix_Computa_5_10_2013_1_48_54_PM.jpg" align="left" hspace="10" /></a>This new, modernized edition provides a clear and thorough introduction to matrix computations,a key component of scientific computing
Retaining the accessible and hands-on style of its predecessor, Fundamentals of Matrix Computations, Third Edition thoroughly details matrix computations and the accompanying theory alongside the author's useful insights. The book presents the most important algorithms of numerical linear algebra and helps readers to understand how the algorithms are developed and why they work.
Along with new and updated examples, the Third Edition features:
A novel approach to Francis' QR algorithm that explains its properties without reference to the basic QR algorithm
Application of classical Gram-Schmidt with reorthogonalization
A revised approach to the derivation of the Golub-Reinsch SVD algorithm
New coverage on solving product eigenvalue problems
Expanded treatment of the Jacobi-Davidson method
A new discussion on stopping criteria for iterative methods for solving linear equations
Throughout the book, numerous new and updated exercises—ranging from routine computations and verifications to challenging programming and proofs—are provided, allowing readers to immediately engage in applying the presented concepts. The new edition also incorporates MATLAB to solve real-world problems in electrical circuits, mass-spring systems, and simple partial differential equations, and an index of MATLAB terms assists readers with understanding the basic co <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378452"> Read more...</a> <BR>]]></description>
<pubDate>Fri, 10 May 2013 13:48:54 GMT</pubDate>
</item>
<item>
<title>Algorithmics: The Spirit of Computing</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=378399</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378399"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Algorithmics__The_Spirit_of_Co_5_10_2013_8_46_02_AM.jpeg" align="left" hspace="10" /></a>Provides a study of the fundamental theoretical ideas of computing and examining how to design accurate and efficient algorithms.

 From the Back Cover
 From a Review of the Previous Edition

 "The book is a veritable tour de force. Harel writes with verve, clarity, and imagination.

 Through the use of tantalizing questions and aptly chosen and often amusing examples, transmits to the reader the excitement and intellectual satisafaction of computer science research. Without the use of formal mathematics and without any sacrifice of intellectual integrity, he conveys to the general reader the profound principles on which computer science is founded and which hitherto were only accessible in abstruse and esoteric textbooks and papers.

 This is scientific writing at its best."

 Dr. Stan Scott, Queen's University, Belfast
 Times Higher Education Supplement <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378399"> Read more...</a> <BR>]]></description>
<pubDate>Fri, 10 May 2013 08:46:02 GMT</pubDate>
</item>
<item>
<title>Biological Modeling and Simulation: A Survey of Practical Models, Algorithms, and Numerical Methods</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=378351</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378351"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Biological_Modeling_and_Simula_5_10_2013_6_07_53_AM.jpg" align="left" hspace="10" /></a> Review
"In twenty-first-century biology, modeling has a similar role as the microscope had in earlier centuries  it is arguably the most important research tool for studying complex phenomena and processes in all areas of the life sciences, from molecular biology to ecosystems analysis. Every biologist therefore needs to be familiar with the basic approaches, methods, and assumptions of modeling. Biological Modeling and Simulation is an essential guide that helps biologists explore the fundamental principles of modeling. It should be on the bookshelf of every student and active researcher."
—Manfred D. Laubichler, School of Life Sciences, Arizona State University, and co-editor of Modeling Biology (MIT Press, 2007)

"Russell Schwartz has produced an excellent and timely introduction to biological modeling. He has found the right balance between covering all major developments of this recently accelerating research field and still keeping the focus and level of the book at a level that is appropriate for all newcomers."
—Zoltan Szallasi, Children's Hospital, Boston

Product Description
There are many excellent computational biology resources now available for learning about methods that have been developed to address specific biological systems, but comparatively little attention has been paid to training aspiring computational biologists to handle new and unanticipated problems. This text is intended to fill that gap by teaching students how to reason about developin <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378351"> Read more...</a> <BR>]]></description>
<pubDate>Fri, 10 May 2013 06:07:53 GMT</pubDate>
</item>
<item>
<title>Real-Time Systems Design and Analysis</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=378213</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378213"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Real-Time_Systems_Design_and_A_5_9_2013_8_51_13_PM.jpg" align="left" hspace="10" /></a>The leading guide to real-time systems design–revised and updated

This third edition of Phillip Laplante’s bestselling, practical guide to building real-time systems maintains its predecessors’ unique holistic, systems-based approach devised to help engineers write problem-solving software. Dr. Laplante incorporates a survey of related technologies and their histories, complete with time-saving practical tips, hands-on instructions, C code, and insights into decreasing ramp-up times.

Real-Time Systems Design and Analysis, Third Edition is essential for students and practicing software engineers who want improved designs, faster computation, and ultimate cost savings. Chapters discuss hardware considerations and software requirements, software systems design, the software production process, performance estimation and optimization, and engineering considerations.

This new edition has been revised to include:
Up-to-date information on object-oriented technologies for real-time including object-oriented analysis, design, and languages such as Java, C++, and C#
Coverage of significant developments in the field, such as:
New life-cycle methodologies and advanced programming practices for real-time, including Agile methodologies
Analysis techniques for commercial real-time operating system technology
Hardware advances, including field-programmable gate arrays and memory technology
Deeper coverage of:
Scheduling and rate-monotonic theories
Synchronization and commun <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378213"> Read more...</a> <BR>]]></description>
<pubDate>Thu, 09 May 2013 20:51:13 GMT</pubDate>
</item>
<item>
<title>Real-Time Systems: Scheduling, Analysis, and Verification</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=378210</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378210"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Real-Time_Systems__Scheduling__5_9_2013_8_43_18_PM.jpg" align="left" hspace="10" /></a>A complete guide to testing, analyzing, verifying, and monitoring real-time systems

More and more of our modern-day systems and devices-from toasters and climate-control systems to airplanes and space shuttles-contain embedded systems to control their functions and ensure that their responses are both timely and correct. With safety a requisite factor, performance validation is a critical aspect of real-time systems. Answering the needs of professionals and students alike, Real-Time Systems: Scheduling, Analysis, and Verification provides a substantial, up-to-date overview of the verification and validation process. It describes several approaches to the problem, and examines the advantages and disadvantages of each approach.

Designed to be both an introductory text and a handy reference for the practitioner, the book discusses:
* Symbolic logic, automata, and languages in non-real-time systems
* Real-time scheduling and schedulability analysis
* Verification using timed automata and timed petri nets
* Process algebra
* The design and analysis of propositional-logic rule-based systems
* Timing analysis of predicate-logic rule-based systems
* Optimization of rule-based systems
* Model checking, real-time logic, and statecharts

With ample illustrations and examples of a variety of industrial and toy applications, Real-Time Systems: Scheduling, Analysis, and Verification serves as a key resource for every professional who works with real-time systems.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=378210"> Read more...</a> <BR>]]></description>
<pubDate>Thu, 09 May 2013 20:43:18 GMT</pubDate>
</item>
<item>
<title>Algorithms in a Nutshell (In a Nutshell (O'Reilly))</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=377978</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377978"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Algorithms_in_a_Nutshell_(In_a_5_9_2013_1_00_36_PM.jpeg" align="left" hspace="10" /></a>Creating robust software requires the use of efficient algorithms, but programmers seldom think about them until a problem occurs. Algorithms in a Nutshell describes a large number of existing algorithms for solving a variety of problems, and helps you select and implement the right algorithm for your needs   with just enough math to let you understand and analyze algorithm performance. 

 With its focus on application, rather than theory, this book provides efficient code solutions in several programming languages that you can easily adapt to a specific project. Each major algorithm is presented in the style of a design pattern that includes information to help you understand why and when the algorithm is appropriate. 

 With this book, you will: 
 Solve a particular coding problem or improve on the performance of an existing solution
 Quickly locate algorithms that relate to the problems you want to solve, and determine why a particular algorithm is the right one to use
 Get algorithmic solutions in C, C++, Java, and Ruby with implementation tips
 Learn the expected performance of an algorithm, and the conditions it needs to perform at its best
 Discover the impact that similar design decisions have on different algorithms
 Learn advanced data structures to improve the efficiency of algorithms

 With Algorithms in a Nutshell, you'll learn how to improve the performance of key algorithms essential for the success of your software applications. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377978"> Read more...</a> <BR>]]></description>
<pubDate>Thu, 09 May 2013 13:00:36 GMT</pubDate>
</item>
<item>
<title>Data Mining: Concepts, Models, Methods, and Algorithms</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=377375</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377375"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Data_Mining__Concepts__Models__5_7_2013_11_57_35_PM.jpeg" align="left" hspace="10" /></a>We are surrounded by data, numerical and otherwise, which must be analyzed and processed to convert it into information that informs, instructs, answers, or otherwise aids understanding and decision-making. Due to the ever-increasing complexity and size of today's data sets, a new term, data mining, was created to describe the indirect, automatic data analysis techniques that utilize more complex and sophisticated tools than those which analysts used in the past to do mere data analysis. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377375"> Read more...</a> <BR>]]></description>
<pubDate>Tue, 07 May 2013 23:57:35 GMT</pubDate>
</item>
<item>
<title>Scheduling: Theory, Algorithms, and Systems,3rd edition</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=377314</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377314"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Scheduling__Theory__Algorithms_5_7_2013_9_13_10_PM.jpeg" align="left" hspace="10" /></a>This book on scheduling covers theoretical models as well as scheduling problems in the real world. Author Michael Pinedo also includes a CD that contains slide-shows from industry and movies dealing with implementations of scheduling systems.
 The book consists of three parts. The first part focuses on deterministic scheduling with the associated combinatorial problems.
 The second part covers probabilistic scheduling models. In this part it is assumed that processing times and other problem data are not known in advance. The third part deals with scheduling in practice. It covers heuristics that are popular with practitioners and discusses system design and development issues.
 Each chapter contains a series of computational and theoretical exercises.
 This book is of interest to theoreticians and practitioners alike. Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource. Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments.
 Michael Pinedo is the Julius Schlesinger Professor of Operations Management at New York University. <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377314"> Read more...</a> <BR>]]></description>
<pubDate>Tue, 07 May 2013 21:13:10 GMT</pubDate>
</item>
<item>
<title>Interactive Theorem Proving and Program Development</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=377261</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377261"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Interactive_Theorem_Proving_an_5_7_2013_7_01_42_PM.jpg" align="left" hspace="10" /></a>Coq is an interactive proof assistant for the development of mathematical theories and formally certified software. It is based on a theory called the calculus of inductive constructions, a variant of type theory.
 This book provides a pragmatic introduction to the development of proofs and certified programs using Coq. With its large collection of examples and exercises it is an invaluable tool for researchers, students, and engineers interested in formal methods and the development of zero-fault software.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377261"> Read more...</a> <BR>]]></description>
<pubDate>Tue, 07 May 2013 19:01:42 GMT</pubDate>
</item>
<item>
<title>Meaning, Logic and Ludics</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=377244</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377244"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Meaning__Logic_and_Ludics_5_7_2013_6_40_30_PM.jpg" align="left" hspace="10" /></a>This book presents several recent advances in natural language semantics and explores the boundaries between syntax and semantics over the last two decades. It is based on some of the most recent theories in logic, such as linear logic and ludics, first created by Jean-Yves Girard, and it also provides some sharp analyses of computational semantical representations, explaining advanced theories in theoretical computer sciences, such as the lambda-mu and Lambek-Grishin calculi which were applied by Philippe de Groote and Michael Moortgat. The author also looks at Aarne Ranta's 'proof as meaning' approach, which was first based on Martin-Lof's Type Theory. 

 Meaning, Logic and Ludics surveys the many solutions which have been proposed for the syntax-semantics interface, taking into account the specifications of linguistic signs (continuous or discontinuous) and the fundamental mechanisms developed by linguists and notable Generativists. This pioneering publication also presents ludics (in a chapter co-authored with Myriam Quatrini), a framework which allows us to characterize meaning as an invariant with regard to interaction between processes. It is an excellent book for advanced students, and academics alike, in the field of computational linguistics.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377244"> Read more...</a> <BR>]]></description>
<pubDate>Tue, 07 May 2013 18:40:30 GMT</pubDate>
</item>
<item>
<title>Reversible Computing</title>
<link>http://www.freebookspot.es/Comments.aspx?Element_ID=377232</link>
<description><![CDATA[<BR> <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377232"><IMG SRC="http://www.freebookspot.es/upload/Algorithms/Reversible_Computing_5_7_2013_6_26_11_PM.jpg" align="left" hspace="10" /></a>Written by one of the few top internationally recognized experts in the field, this book concentrates on those topics that will remain fundamental, such as low power computing, reversible programming languages, and applications in thermodynamics. It describes reversible computing from various points of view: Boolean algebra, group theory, logic circuits, low-power electronics, communication, software, quantum computing. It is this multidisciplinary approach that makes it unique.
Backed by numerous examples, this is useful for all levels of the scientific and academic community, from undergraduates to established academics.
 <a href="http://www.freebookspot.es/Comments.aspx?Element_ID=377232"> Read more...</a> <BR>]]></description>
<pubDate>Tue, 07 May 2013 18:26:11 GMT</pubDate>
</item>
</channel>
</rss>
