Welcome to our book review site go-pdf.online!
You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Combinatorial Algorithms
This book constitutes the thoroughly refereed post-workshop proceedings of the 24th International Workshop on Combinatorial Algorithms, IWOCA 2013, held in Rouen, France, in July 2013. The 33 revised full papers presented together with 10 short papers and 5 invited talks were carefully reviewed and selected from a total of 91 submissions. The papers are organized in topical sections on algorithms on graphs; algorithms on strings; discrete geometry and satisfiability.
Belief Functions: Theory and Applications
The theory of belief functions, also known as evidence theory or Dempster-Shafer theory, was first introduced by Arthur P. Dempster in the context of statistical inference, and was later developed by Glenn Shafer as a general framework for modeling epistemic uncertainty. These early contributions have been the starting points of many important developments, including the Transferable Belief Model and the Theory of Hints. The theory of belief functions is now well established as a general framework for reasoning with uncertainty, and has well understood connections to other frameworks such as probability, possibility and imprecise probability theories. This volume contains the proceedings of the 2nd International Conference on Belief Functions that was held in Compiègne, France on 9-11 May 2012. It gathers 51 contributions describing recent developments both on theoretical issues (including approximation methods, combination rules, continuous belief functions, graphical models and independence concepts) and applications in various areas including classification, image processing, statistics and intelligent vehicles.
Combinatorial Algorithms
This book constitutes the thoroughly referred post-proceedings of the 21st International Workshop on Combinatorial Algorithms, IWOCA 2010, held in London, UK, in July 2010. The 31 revised full papers presented together with extended abstracts of 8 poster presentations were carefully reviewed and selected from a total of 85 submissions. A broad variety of combinatorial graph algorithms for the computations of various graph features are presented; also algorithms for network compuation, approximation, computational geometry, games, and search are presented and complexity aspects of such algorithms are discussed.
Combinatorial Pattern Matching
This book constitutes the refereed proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000, held in Montreal, Canada, in June 2000.The 29 revised full papers presented together with 3 invited contributions and 2 tutorial lectures were carefully reviewed and selected from 44 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expression graphs, point sets and arrays as well as to advanced applications of CPM in areas such as Internet, computational biology, multimedia systems, information retrieval, data compression, and pattern recognition.
String Processing and Information Retrieval
This book constitutes the refereed proceedings of the 20th International Symposium on String Processing and Information Retrieval, SPIRE 2013, held in Jerusalem, Israel, in October 2013. The 18 full papers, 10 short papers were carefully reviewed and selected from 60 submissions. The program also featured 4 keynote speeches. The following topics are covered: fundamentals algorithms in string processing and information retrieval; SP and IR techniques as applied to areas such as computational biology, DNA sequencing, and Web mining.
Fundamentals of Computation Theory
This book constitutes the refereed proceedings of the 21st International Symposium on Fundamentals of Computation Theory, FCT 2017, held in Bordeaux, France, in September 2017. The 29 revised full papers and 5 invited papers presented were carefully reviewed and selected from 99 submissions. The papers cover topics of all aspects of theoretical computer science, in particular algorithms, complexity, formal and logical methods.
Medical Image Computing and Computer-Assisted Intervention -- MICCAI 2012
The three-volume set LNCS 7510, 7511, and 7512 constitutes the refereed proceedings of the 15th International Conference on Medical Image Computing and Computer-Assisted Intervention, MICCAI 2012, held in Nice, France, in October 2012. Based on rigorous peer reviews, the program committee carefully selected 252 revised papers from 781 submissions for presentation in three volumes. The first volume includes 91 papers organized in topical sections on abdominal imaging, computer-assisted interventions and robotics; computer-aided diagnosis and planning; image reconstruction and enhancement; analysis of microscopic and optical images; computer-assisted interventions and robotics; image segmentation; cardiovascular imaging; and brain imaging: structure, function and disease evolution.
Mathematical Foundations of Computer Science 2002
This book constitutes the refereed proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science, MFCS 2002, held in Warsaw, Poland in August 2002. The 48 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 108 submissions. All relevant aspects of theoretical computer science are addressed, ranging from discrete mathematics, combinatorial optimization, graph theory, algorithms, and complexity to programming theory, formal methods, and mathematical logic.
Algorithms in Bioinformatics
This book constitutes the refereed proceedings of the Third International Workshop on Algorithms in Bioinformatics, WABI 2003, held in Budapest, Hungary, in September 2003. The 36 revised full papers presented were carefully reviewed and selected from 78 submissions. The papers are organized in topical sections on comparative genomics, database searching, gene finding and expression, genome mapping, pattern and motif discovery, phylogenetic analysis, polymorphism, protein structure, sequence alignment, and string algorithms.
Data Structures
None
