الصفحة 7
الصفحة 7
Computer science : Theory and applications ; 15th International computer science symposium in Russia, CSR 2020, Yekaterinburg, Russia, June 29 – July 3, 2020, Proceedings
This book constitutes the proceedings of the 15th International Computer Science Symposium in Russia, CSR 2020, held in Yekaterinburg, Russia, in June 2020. The 25 full papers and 6 invited papers were carefully reviewed and selected from 49 submissions. The papers cover a broad range of topics, such as: algorithms and data structures; computational complexity, including hardness of approximation and parameterized complexity; randomness in computing, approximation algorithms, fixed-parameter algorithms; combinatorial optimization, constraint satisfaction, operations research; computational geometry; string algorithms; formal languages and automata, including applications to computational linguistics; codes and cryptography; combinatorics in computer science; computational biology; applications of logic to computer science, proof complexity; database theory; distributed computing; fundamentals of machine learning, including learning theory, grammatical inference and neural computing; computational social choice; quantum computing and quantum cryptography; theoretical aspects of big data.
Computational Science and High Performance Computing II ; The 2nd Russian-German Advanced Research Workshop, Stuttgart, Germany, March 14 to 16, 2005
This volume contains 27 contributions to the Second Russian-German Advanced Research Workshop on Computational Science and High Performance Computing presented in March 2005 at Stuttgart, Germany. The workshop was organized jointly by the High Performance Computing Center Stuttgart (HLRS) and the Russian Institute for Computational Technologies (ICT SB RAS) The contributions range from computer science, mathematics and high performance computing to applications in mechanical and aerospace engineering. They show a wealth of theoretical work and simulation experience with a potential of bringing together theoretical mathematical modelling and usage of high performance computing systems presenting the state of the art of computational technologies.
Computational Methods in Transport ; Granlibakken 2004
Based on a series of lectures given in the Granlibakken workshop was devoted to providing a forum, where computational transport researchers could communicate their methods with their results. This book presents computational transport in mathematics, astrophysics, high energy density physics, atmospheric physics, oceanography, and plant canopies.
Computational methods in engineering and science ; Proceedings of enhancement and promotion of computational methods in engineering and science X" Aug. 21-23, 2006, Sanya, China
Here are the printed proceedings of EPMESC X, held on August 21-23, 2006 in Sanya, Hainan Island of China. It includes 14 full papers of plenary and semi-plenary lectures and approximately 166 one-page summaries. The accompanying CD-ROM includes all 180 full papers presented at the conference.
Computational methods for nanoscale applications : Particles, plasmons and waves
Computational Methods for Nanoscale Applications: Particles, Plasmons and Waves presents new perspectives on modern nanoscale problems where fundamental science meets technology and computer modeling. This book describes well-known computational techniques such as finite-difference schemes, finite element analysis and Ewald summation, as well as a new finite-difference calculus of Flexible Local Approximation MEthods (FLAME) that qualitatively improves the numerical accuracy in a variety of problems. Application areas in the book include long-range particle interactions in homogeneous and heterogeneous media, electrostatics of colloidal systems, wave propagation in photonic crystals, photonic band structure, plasmon field enhancement, and metamaterials with backward waves and negative refraction.
Computational Methods for Algebraic Spline Surfaces : ESF Exploratory Workshop
The papers included in this volume provide an overview about the state-of-the-art in approximative implicitization and various related topics, including both the theoretical basis and the existing computational techniques. The novel idea of approximate implicitization has strengthened the existing link between Computer Aided Geometric Design and classical algebraic geometry. There is a growing interest from researchers and professionals both in CAGD and Algebraic Geometry, to meet and combine knowledge and ideas, in order to better solve industrial--type challenges, as well as to initiate new directions for basic research. This volume will support this exchange of ideas between the various communities.
Computational Many-Particle Physics
Complicated many-particle problems abound in nature and in research alike. Plasma physics, statistical physics and condensed matter physics, as primary examples, are all heavily dependent on efficient methods for solving such problems. Addressing graduate students and young researchers, this book presents an overview and introduction to state-of-the-art numerical methods for studying interacting classical and quantum many-particle systems. A broad range of techniques and algorithms are covered, and emphasis is placed on their implementation on modern high-performance computers.
Computational Geometry and Graph Theory ; International Conference, KyotoCGGT 2007, Kyoto, Japan, June 11-15, 2007. Revised Selected Papers
This book constitutes the thoroughly refereed post-conference proceedings of the Kyoto Conference on Computational Geometry and Graph Theory, KyotoCGGT 2007, held in Kyoto, Japan, in June 2007.
Computational Electromagnetics
Computational Electromagnetics is a young and growing discipline, expanding as a result of the steadily increasing demand for software for the design and analysis of electrical devices. This book introduces three of the most popular numerical methods for simulating electromagnetic fields: the finite difference method, the finite element method and the method of moments. In particular it focuses on how these methods are used to obtain valid approximations to the solutions of Maxwell's equations, using, for example, "staggered grids" and "edge elements." The main goal of the book is to make the reader aware of different sources of errors in numerical computations, and also to provide the tools for assessing the accuracy of numerical methods and their solutions. To reach this goal, convergence analysis, extrapolation, von Neumann stability analysis, and dispersion analysis are introduced and used frequently throughout the book. Another major goal of the book is to provide students with enough practical understanding of the methods so they are able to write simple programs on their own. To achieve this, the book contains several MATLAB programs and detailed description of practical issues such as assembly of finite element matrices and handling of unstructured meshes.
Combinatorial pattern matching ; Vol.4009) ; 17th Annual Symposium, CPM 2006, Barcelona, Spain, July 5-7, 2006, Proceedings
The book presents 33 revised full papers together with 3 invited talks, organized in topical sections on data structures, indexing data structures, probabilistic and algebraic techniques, applications in molecular biology, string matching, data compression, and dynamic programming
Combinatorial pattern matching ; 18th Annual Symposium, CPM 2007, London, Canada, July 9-11, 2007, Proceedings
This book presented original research contri- tions on computational pattern matching and analysis, data compression and compressed text processing, sufix arrays and trees, and computational biology. Combinatorial Pattern Matching addresses issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays.The goal is to derive non-trivial combinatorial properties of such structures and to exploit these properties in order to either achieve superior performance for the corresponding computational problems or pinpoint conditions under which searches cannot be performed eficiently.
Combinatorial pattern matching ; 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings
This book constitutes the refereed proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching, CPM 2001, held in Jerusalem, Israel, in July 2001. The 21 revised papers presented together with one invited paper were carefully reviewed and selected from 35 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays as well as to advanced applications of CPM in areas such as the Internet, computational biology, multimedia systems, information retrieval, data compression, coding, computer vision, and pattern recognition.
Combinatorial optimization and applications ; 2nd International Conference, COCOA 2008, St. John’s, NL, Canada, August 21-24, 2008. Proceedings
This book constitutes the refereed proceedings of the Second International Conference on Combinatorial Optimization and Applications, COCOA 2008, held in St. John's, Canada, in August 2008.
Combinatorial optimization and applications ; 1st International Conference, COCOA 2007, Xi'an, China, August 14-16, 2007, Proceedings
This book presented feature original research in the areas of combinatorial optimization - both theoretical issues and and applications motivated by real-world problems thus showing convincingly the usefulness and efficiency of the algorithms discussed in a practical setting.
Combinatorial optimization and applications ; 14th International Conference, COCOA 2020, Dallas, TX, USA, December 11–13, 2020, Proceedings
This volume constitutes the proceedings of the 14th International Conference on Combinatorial Optimization and Applications, COCOA 2020, held in Dallas, TX, USA, in December 2020. The 55 full papers presented in this volume were carefully reviewed and selected from 104 submissions. The papers are grouped into the following topics: Approximation Algorithms; Scheduling; Network Optimization; Complexity and Logic; Search, Facility and Graphs; Geometric Problem; Sensors, Vehicles and Graphs; and Graph Problems.
Combinatorial image analysis ; 10th International Workshop, IWCIA 2004, Auckland, New Zealand, December 1-3, 2004, Proceedings
This volume presents the proceedings of the 10th International Workshop on Combinatorial Image Analysis,held 2004, in Auckland, New Zealand. For this workshop we received 86 submitted papers from 23 countries. We selected 55 papers for the conference. 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 and Algorithmic Aspects of Networking ; 4th Workshop, CAAN 2007, Halifax, Canada, August 14, 2007, Revised Papers
It contiants developments on all aspects of networking could be presented. It covered were diverse, with talks on strategies for searching in networks, for cleaning networks of unwanted - truders, on difierent routing strategies, and on scheduling, load balancing, probability, a concept central to network modeling and managing.
Combinatorial and Algorithmic Aspects of Networking (vol. # 4235) ; Third Workshop, CAAN 2006, Chester, UK, July 2, 2006, Revised Papers
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.
Mathematical Methods in Time Series Analysis and Digital Image Processing
The aim of this volume is to bring together research directions in theoretical signal and imaging processing developed rather independently in electrical engineering, theoretical physics, mathematics and the computer sciences. In particular, mathematically justified algorithms and methods, the mathematical analysis of these algorithms, and methods as well as the investigation of connections between methods from time series analysis and image processing are reviewed. An interdisciplinary comparison of these methods, drawing upon common sets of test problems from medicine and geophysical/enviromental sciences, is also addressed.
Mathematical Foundations of Computer Science 2005 ; 30th International Symposium, MFCS 2005, Gdansk, Poland, August29-September 2. 2005, Proceedings
Constitutes the proceedings of the 30th International Symposium on Mathematical Foundations of Computer Science, MFCS 2005, held in Gdansk, Poland in August/September 2005. The 62 papers address various aspects in theoretical computer science, ranging from quantum computing, approximation, automata, circuits, scheduling, games, and more.
