Hasil Pencarian  ::  Simpan CSV :: Kembali

"This book constitutes the refereed proceedings of the 23rd Annual Symposium on Combinatorial Pattern Matching, CPM 2012, held in Helsinki, Finland, in July 2012. The 33 revised full papers presented together with 2 invited talks were carefully reviewed and selected from 60 submissions. The papers address 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 efficiently. The meeting also deals with problems in computational biology, data compression and data mining, coding, information retrieval, natural language processing, and pattern recognition"

"The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. "

"The ALENEX workshop provides a forum for the presentation of original research in the implementation and experimental evaluation of algorithms and data structures. This volume collects extended versions of the 12 papers that were selected for presentation."

"This research presents significant studies in experimental analysis or in the implementation, testing, and evaluation of algorithms for realistic environments and scenarios. The paper presentations address specific applied areas that present unique challenges in their underlying algorithmic problems as well as methodological issues and standards in the context of empirical research on algorithms and data structures. This proceedings collects extended versions of the 12 papers that were selected for presentation from a pool of 38 submissions."

"This symposium concerned research on the use, design, and analysis of efficient algorithms and data structures, and on the mathematical problems related to the development and analysis of discrete algorithms. The papers are based on the extent to which the results yield new insights for the design, use, or analysis of efficient algorithms. Performance analysis cover analytical and experimental, worst-case and average-case performance. The studies are both theoretical or based on real data sets, and address methodological issues involved in performance analysis. They cover the discrete mathematics and experimental and applied algorithms communities."

"This book constitutes the refereed proceedings of the 18th Annual International Conference on Computing and Combinatorics, held in Sydney, Australia, in August 2012. The 50 revised full papers presented were carefully reviewed and selected from 121 submissions. Topics covered are algorithms and data structures, algorithmic game theory and online algorithms, automata, languages, logic, and computability, combinatorics related to algorithms and complexity, complexity theory, computational learning theory and knowledge discovery, cryptography, reliability and security, and database theory, computational biology and bioinformatics, computational algebra, geometry, and number theory, graph drawing and information visualization, graph theory, communication networks, and optimization."

"The annual Workshop on Algorithm Engineering and Experiments (ALENEX) provides a forum for the presentation of original research in all aspects of algorithm engineering, including the implementation and experimental evaluation of algorithms and data structures. The workshop was sponsored by SIAM, the Society for Industrial and Applied Mathematics, and SIGACT, the ACM Special Interest Group on Algorithms and Computation Theory. The aim of ANALCO is to provide a forum for the presentation of original research in the analysis of algorithms and associated combinatorial structures."

"Contains 130 papers, which were selected based on originality, technical contribution, and relevance. Although the papers were not formally refereed, every attempt was made to verify the main claims. It is expected that most will appear in more complete form in scientific journals."

"Today, almost all Russian-language mathematical journals are translated into English; however, there remains an interest in and demand for the original Russian scientific literature. This volume fulfills a need by scientists and translators for a dictionary with current terminology in probability theory, mathematical statistics, combinatorics, and their applications. Borovkov's dictionary, which is the only one that translates from Russian to English and English to Russian in these subject areas, will help specialists to read and understand Russian- language texts covering these topics. It is especially useful because it contains entries related to developments that have occurred in probability, statistics, and combinatorics over the past three decades. Each half of the dictionary contains approximately 7,500 terms and expressions, as well as the spelling of many names that appear in scientific and technical literature."