Browse Results

Select your format based upon: 1) how you want to read your book, and 2) compatibility with your reading tool. To learn more about using Bookshare with your device, visit the Help Center.

Here is an overview of the specialized formats that Bookshare offers its members with links that go to the Help Center for more information.

• Bookshare Web Reader - A customized reading tool for Bookshare members offering all the features of DAISY with a single click of the "Read Now" link.
• DAISY (Digital Accessible Information System) - A digital book file format. DAISY books from Bookshare are DAISY 3.0 text files that work with just about every type of access technology that reads text. Books that contain images will have the download option of ‘DAISY Text with Images’.
• BRF (Braille Refreshable Format) - Digital Braille for use with refreshable Braille devices and Braille embossers.
• MP3 (MPEG audio layer 3) - Provides audio only with no text. These books are created with a text-to-speech engine and spoken by Kendra, a high quality synthetic voice from Ivona. Any device that supports MP3 playback is compatible.
• DAISY Audio - Similar to the DAISY option above; however, this option uses MP3 files created with our text-to-speech engine that utilizes Ivonas Kendra voice. This format will work with Daisy Audio compatible players such as Victor Reader Stream and Read2Go.
• EPUB - A standard e-book format that can be read on many tools, such as iBooks, Readium or others.
• Word - Accessible Word output, which can be unzipped and opened in any tool that allows .docx files

Combinatorial and Algorithmic Aspects of Networking: Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers (Lecture Notes in Computer Science #4235)

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

Combinatorial and Algorithmic Aspects of Networking: First Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2004, Banff, Alberta, Canada, August 5-7, 2004, Revised Selected Papers (Lecture Notes in Computer Science #3405)

Combinatorial and Algorithmic Aspects of Networking: 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers (Lecture Notes in Computer Science #4852)

This book constitutes the thoroughly refereed post-conference proceedings of the 4th Workshop on Combinatorial and Algorithmic Aspects of Networking, CAAN 2007, held in Halifax, Canada, in August 2007, co-located with the 10th Workshop on Algorithms and Data Structures, WADS 2007. The main focus is on strategies for searching in networks, and for cleaning networks of unwanted intruders, on different routing strategies, and on scheduling and load balancing.

Combinatorial Complexes: A Mathematical Theory of Algorithms (Mathematics and Its Applications #2)

It isn't that they can't see the Approach your problems from the right end and begin with the solution. It is that they can't see answers. Then, one day, perhaps the problem. you will find the final question. 'The Hermit Clad in Crane Feathers' G. K. Chesterton, The scandal of in R. Van Gulik's The Chinese Maze Father Brown "The point of a Murders. pin" Growing specialization and diversification have brought a host of monographs and textbooks on increasingly specialized topics. However, the 'tree' of knowledge of mathematics and related fields does not grow only by putting forth new branches. It also happens, quite often in fact, that branches which were thought to be com­ pletely disparate are suddenly seen to be related. Further, the kind and level of sophistication of mathematics applied in various sciences has changed drastically in recent years: measure theory is used (non-trivially) in regional and theoretical economics; algebraic geometry interacts with physics; the Minkowsky lemma, coding theory and the structure of water meet one another in packing and covering theory; quantum fields, crys­ tal defects and mathematical programming profit from homotopy theory; Lie algebras are relevant to filtering; and prediction and electrical engineering can use Stein spaces.

Combinatorial Computational Biology of RNA: Pseudoknots and Neutral Networks

In this monograph, new combinatorial and computational approaches in the study of RNA structures are presented which enhance both mathematics and computational biology. It begins with an introductory chapter, which motivates and sets the background of this research. In the following chapter, all the concepts are systematically developed. The reader will find * integration of more than forty research papers covering topics like, RSK-algorithm, reflection principle, singularity analysis and random graph theory * systematic presentation of the theory of pseudo-knotted RNA structures including their generating function, uniform generation as well as central and discrete limit theorems * computational biology of pseudo-knotted RNA structures, including dynamic programming paradigms and a new folding algorithm * analysis of neutral networks of pseudo knotted RNA structures and their random graph theory, including neutral paths, giant components and connectivity All algorithms presented are freely available through springer.com and implemented in C. A proofs section at the end contains the necessary technicalities. This book will serve graduate students and researchers in the fields of discrete mathematics, mathematical and computational biology. It is suitable as a textbook for a graduate course in mathematical and computational biology.

Combinatorial Designs: Constructions and Analysis

Created to teach students many of the most important techniques used for constructing combinatorial designs, this is an ideal textbook for advanced undergraduate and graduate courses in combinatorial design theory. The text features clear explanations of basic designs, such as Steiner and Kirkman triple systems, mutual orthogonal Latin squares, finite projective and affine planes, and Steiner quadruple systems. In these settings, the student will master various construction techniques, both classic and modern, and will be well-prepared to construct a vast array of combinatorial designs. Design theory offers a progressive approach to the subject, with carefully ordered results. It begins with simple constructions that gradually increase in complexity. Each design has a construction that contains new ideas or that reinforces and builds upon similar ideas previously introduced. A new text/reference covering all apsects of modern combinatorial design theory. Graduates and professionals in computer science, applied mathematics, combinatorics, and applied statistics will find the book an essential resource.

Combinatorial Geometry and Graph Theory: Indonesia-Japan Joint Conference, IJCCGGT 2003, Bandung, Indonesia, September 13-16, 2003, Revised Selected Papers (Lecture Notes in Computer Science #3330)

Combinatorial Image Analysis: 17th International Workshop, IWCIA 2015, Kolkata, India, November 24-27, 2015. Proceedings (Lecture Notes in Computer Science #9448)

This volume constitutes the refereed proceedings of the 17th International Workshop on Combinatorial Image Analysis, IWCIA 2015, held in Kolkata, India, in November 2015. The 24 revised full papers and 2 invited papers presented were carefully reviewed and selected from numerous submissions. The workshop provides theoretical foundations and methods for solving problems from various areas of human practice. In contrast to traditional approaches to image analysis which implement continuous models, float arithmetic and rounding, combinatorial image analysis features discrete modelsusing integer arithmetic. The developed algorithms are based on studying combinatorial properties of classes of digital images, and often appear to be more efficient and accurate than those based on continuous models.

Combinatorial Image Analysis: 15th International Workshop, IWCIA 2012, Austin, TX, USA, November 28-30, 2012, Proceedings (Lecture Notes in Computer Science #7655)

This volume constitutes the refereed proceedings of the 15th International Workshop on Combinatorial Image Analysis, IWCIA 2012, held in Austin, TX, USA in November 2012. The 23 revised full papers presented were carefully reviewed and selected from numerous submissions. The topics covered include digital geometry, combinatorics in digital spaces, digital curves and surfaces; digital topologyl grammars, transformation, applications; grammars and models in image analysis; picture transformations, morphologic operations, image segmentation; and discrete tomography, applications.

Combinatorial Image Analysis: 21st International Workshop, IWCIA 2022, Messina, Italy, July 13–15, 2022, Proceedings (Lecture Notes in Computer Science #13348)

This book constitutes the refereed proceedings of the 201st International Workshop on Combinatorial Image Analysis, IWCIA 2022, held in Messina, Italy, in July 2022.The 20 full papers presented were carefully reviewed and selected from 24 submissions. The papers are grouped into four sections. The first one consists of one invited talk. The second section contains seven papers devoted to digital geometry and topology. The third part consists of six papers discussing picture languages. The last part, including six papers, is devoted to various applications. We believe that many of these papers would be of interest to a broader audience, including researchers in scientific areas such as computer vision, shape modeling, pattern analysis and recognition, and computer graphics.

Combinatorial Image Analysis: 16th International Workshop, IWCIA 2014, Brno, Czech Republic, May 28-30, 2014, Proceedings (Lecture Notes in Computer Science #8466)

This volume constitutes the refereed proceedings of the 16th International Workshop on Combinatorial Image Analysis, IWCIA 2014, held in Brno, Czech Republic, in May 2014. The 20 revised full papers and 3 invited papers presented were carefully reviewed and selected from numerous submissions. The topics covered include discrete geometry and topology in imaging science, new results in image representation, segmentation, grouping, and reconstruction, medical image processing.

Combinatorial Image Analysis: 19th International Workshop, IWCIA 2018, Porto, Portugal, November 22–24, 2018, Proceedings (Lecture Notes in Computer Science #11255)

This book constitutes the refereed proceedings of the 19th International Workshop on Combinatorial Image Analysis, IWCIA 2018, held in Porto, Portugal, in November 2018.The 18 revised full papers presented were carefully reviewed and selected from 32 submissions. The papers are grouped into two sections. The first one includes nine papers devoted to theoretical foundations of combinatorial image analysis, including digital geometry and topology, array grammars, tilings and patterns, discrete geometry in non-rectangular grids, and other technical tools for image analysis. The second part includes nine papers presenting application-driven research on topics such as discrete tomography, image segmentation, texture analysis, and medical imaging.

Combinatorial Image Analysis: 18th International Workshop, IWCIA 2017, Plovdiv, Bulgaria, June 19-21, 2017, Proceedings (Lecture Notes in Computer Science #10256)

This book constitutes the proceedings of the 18th International Workshop on Combinatorial Image Analysis, IWCIA 2017, held in Plovdiv, Bulgaria, in June 2017. The 27 revised full papers presented were carefully reviewed and selected from 47 submissions.The workshop is organized in topical sections of theoretical foundations and theory of applications, namely: discrete geometry and topology; tilings and patterns; grammars, models and other technical tools for image analysis; image segmentation, classification; reconstruction; compression; texture analysis; bioimaging.

Combinatorial Image Analysis: 12th International Workshop, IWCIA 2008, Buffalo, NY, USA, April 7-9, 2008, Proceedings (Lecture Notes in Computer Science #4958)

Combinatorial Image Analysis: 14th International Workshop, IWCIA 2011, Madrid, Spain, May 23-25, 2011. Proceedings (Lecture Notes in Computer Science #6636)

This volume constitutes the refereed proceedings of the 14th International Workshop on Combinatorial Image Analysis, IWCIA 2011, held in Madrid, Spain, in May 2011. The 25 revised full papers and 13 poster papers presented together with 4 invited contributions were carefully reviewed and selected from 60 submissions. The papers are organized in topical sections such as combinatorial problems in the discrete plane and space related to image analysis; lattice polygons and polytopes; discrete/combinatorial geometry and topology and their use in image analysis; digital geometry of curves and surfaces; tilings and patterns; combinatorial pattern matching; image representation, segmentation, grouping, and reconstruction; methods for image compression; discrete tomography; applications of integer programming, linear programming, and computational geometry to problems of image analysis; parallel architectures and algorithms for image analysis; fuzzy and stochastic image analysis; grammars and models for image or scene analysis and recognition, cellular automata; mathematical morphology and its applications to image analysis; applications in medical imaging, biometrics, and others.

Combinatorial Image Analysis: 10th International Workshop, IWCIA 2004, Auckland, New Zealand, December 1-3, 2004, Proceedings (Lecture Notes in Computer Science #3322)

This volume presents the proceedings of the 10th International Workshop on Combinatorial Image Analysis, held December 1–3, 2004, in Auckland, New Zealand. Prior meetings took place in Paris (France, 1991), Ube (Japan, 1992), Washington DC (USA, 1994), Lyon (France, 1995), Hiroshima (Japan, 1997), Madras (India, 1999), Caen (France, 2000), Philadelphia (USA, 2001), and - lermo (Italy, 2003). For this workshop we received 86 submitted papers from 23 countries. Each paper was evaluated by at least two independent referees. We selected 55 papers for the conference. Three invited lectures by Vladimir Kovalevsky (Berlin), Akira Nakamura (Hiroshima), and Maurice Nivat (Paris) completed the program. Conference papers are presented in this volume under the following topical part titles: discrete tomography (3 papers), combinatorics and computational models (6), combinatorial algorithms (6), combinatorial mathematics (4), d- ital topology (7), digital geometry (7), approximation of digital sets by curves and surfaces (5), algebraic approaches (5), fuzzy image analysis (2), image s- mentation (6), and matching and recognition (7). These subjects are dealt with in the context of digital image analysis or computer vision.

Combinatorial Image Analysis: 20th International Workshop, IWCIA 2020, Novi Sad, Serbia, July 16–18, 2020, Proceedings (Lecture Notes in Computer Science #12148)

This book constitutes the refereed proceedings of the 20th International Workshop on Combinatorial Image Analysis, IWCIA 2020, held in Novi Sad, Serbia, in July 2020. The 20 full papers presented were carefully reviewed and selected from 23 submissions. The papers are grouped into two sections. The first one includes twelve papers devoted to theoretical foundations of combinatorial image analysis, including digital geometry and topology, array grammars, picture languages, digital tomography, and other technical tools for image analysis. The second part includes eight papers presenting application-driven research on topics such as image repairing, annotation of images, image reconstruction, forgery detection, and dealing with noise in images.

Combinatorial Image Analysis: 11th International Workshop, IWCIA 2006, Berlin, Germany, June 19-21, 2006, Proceedings (Lecture Notes in Computer Science #4040)

This volume constitutes the refereed proceedings of the 11th International Workshop on Combinatorial Image Analysis, IWCIA 2006, held in Berlin, June 2006. The book presents 34 revised full papers together with two invited papers, covering topics including combinatorial image analysis; grammars and models for analysis and recognition of scenes and images; combinatorial topology and geometry for images; digital geometry of curves and surfaces; algebraic approaches to image processing, and more.

Combinatorial Image Analysis: 13th International Workshop, IWCIA 2009, Playa del Carmen, Mexico, November 24-27, 2009, Proceedings (Lecture Notes in Computer Science #5852)

This volume constitutes the refereed proceedings of the 13th International Workshop on Combinatorial Image Analysis, IWCIA 2009, held in Playa del Carmen, Mexico, in November 2009. The 32 revised full papers and one invited paper presented were carefully reviewed and selected from 70 initial submissions. The papers are organized in topical sections on digital geometry: curves, straightness, convexity, geometric transformations, metrics, distance transforms and skeletons, segmentation, thinning, skeletonization, image representation, processing, analysis, reconstruction and recognition, digital tomography, image models based on geometry, combinatorics, arithmetics, algebra, mathematical morphology, topology and grammars, as well as digital topology and its applications to image modeling and analysis.

Combinatorial Machine Learning: A Rough Set Approach (Studies in Computational Intelligence #360)

Decision trees and decision rule systems are widely used in different applicationsas algorithms for problem solving, as predictors, and as a way forknowledge representation. Reducts play key role in the problem of attribute(feature) selection. The aims of this book are (i) the consideration of the setsof decision trees, rules and reducts; (ii) study of relationships among theseobjects; (iii) design of algorithms for construction of trees, rules and reducts;and (iv) obtaining bounds on their complexity. Applications for supervisedmachine learning, discrete optimization, analysis of acyclic programs, faultdiagnosis, and pattern recognition are considered also. This is a mixture ofresearch monograph and lecture notes. It contains many unpublished results.However, proofs are carefully selected to be understandable for students.The results considered in this book can be useful for researchers in machinelearning, data mining and knowledge discovery, especially for those who areworking in rough set theory, test theory and logical analysis of data. The bookcan be used in the creation of courses for graduate students.

Combinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing

A Versatile Framework for Handling Subdivided Geometric ObjectsCombinatorial Maps: Efficient Data Structures for Computer Graphics and Image Processing gathers important ideas related to combinatorial maps and explains how the maps are applied in geometric modeling and image processing. It focuses on two subclasses of combinatorial maps: n-Gmaps an

Combinatorial Methods with Computer Applications (Discrete Mathematics And Its Applications Ser.)

Combinatorial Methods with Computer Applications provides in-depth coverage of recurrences, generating functions, partitions, and permutations, along with some of the most interesting graph and network topics, design constructions, and finite geometries. Requiring only a foundation in discrete mathematics, it can serve as the textbook in a combinat

Combinatorial Network Theory (Applied Optimization #1)

A basic problem for the interconnection of communications media is to design interconnection networks for specific needs. For example, to minimize delay and to maximize reliability, networks are required that have minimum diameter and maximum connectivity under certain conditions. The book provides a recent solution to this problem. The subject of all five chapters is the interconnection problem. The first two chapters deal with Cayley digraphs which are candidates for networks of maximum connectivity with given degree and number of nodes. Chapter 3 addresses Bruijn digraphs, Kautz digraphs, and their generalizations, which are candidates for networks of minimum diameter and maximum connectivity with given degree and number of nodes. Chapter 4 studies double loop networks, and Chapter 5 considers broadcasting and the Gossiping problem. All the chapters emphasize the combinatorial aspects of network theory. Audience: A vital reference for graduate students and researchers in applied mathematics and theoretical computer science.

Combinatorial Optimization: New Frontiers in Theory and Practice (NATO ASI Subseries F: #82)

There have been significant developments in the theory and practice of combinatorial optimization in the last 15 years. This progress has been evidenced by a continuously increasing number of international and local conferences, books and papers in this area. This book is also another contribution to this burgeoning area of operations research and optimization. This volume contains the contributions of the participants of the recent NATO Ad­ vanced Study Institute, New Frontiers in the Theory and Practice of Combinatorial Op­ timization, which was held at the campus of Bilkent University, in Ankara, Turkey, July 16-29, 1990. In this conference, we brought many prominent researchers and young and promising scientists together to discuss current and future trends in the theory and prac­ tice of combinatorial optimization. The Bilkent campus was an excellent environment for such an undertaking. Being outside of Ankara, the capital of Turkey, Bilkent University gave the participants a great opportunity for exchanging ideas and discussing new theories and applications without much distraction. One of the primary goals of NATO ASIs is to bring together a group of scientists and research scientists primarily from the NATO countries for the dissemination of ad­ vanced scientific knowledge and the promotion of international contacts among scientists. We believe that we accomplished this mission very successfully by bringing together 15 prominent lecturers and 45 promising young scientists from 12 countries, in a university environment for 14 days of intense lectures, presentations and discussions.

Combinatorial Optimization: 6th International Symposium, ISCO 2020, Montreal, QC, Canada, May 4–6, 2020, Revised Selected Papers (Lecture Notes in Computer Science #12176)

This book constitutes the thoroughly refereed post-conference proceedings of the 6th International Symposium on Combinatorial Optimization, ISCO 2020, which was due to be held in Montreal, Canada, in May 2020. The conference was held virtually due to the COVID-19 pandemic.The 24 revised full papers presented in this book were carefully reviewed and selected from 66 submissions.They were organized in the following topical sections: polyhedral combinatorics; integer programming; scheduling; matching; Network Design; Heuristics.