Listing 1 - 10 of 11 | << page >> |
Sort by
|
Choose an application
This book constitutes the refereed proceedings of the 13th International Conference on Combinatorics on Words, WORDS 2021, held virtually in September 2021. The 14 revised full papers presented in this book together with 2 invited talks were carefully reviewed and selected from 18 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc.
Combinatorial analysis --- Word problems (Mathematics) --- Problems, Word (Mathematics) --- Story problems (Mathematics) --- Mathematics --- Machine theory. --- Computer networks. --- Algorithms. --- Natural language processing (Computer science). --- Computer science—Mathematics. --- Discrete mathematics. --- Formal Languages and Automata Theory. --- Computer Communication Networks. --- Natural Language Processing (NLP). --- Discrete Mathematics in Computer Science. --- NLP (Computer science) --- Artificial intelligence --- Electronic data processing --- Human-computer interaction --- Semantic computing --- Discrete mathematical structures --- Mathematical structures, Discrete --- Structures, Discrete mathematical --- Numerical analysis --- Algorism --- Algebra --- Arithmetic --- Communication systems, Computer --- Computer communication systems --- Data networks, Computer --- ECNs (Electronic communication networks) --- Electronic communication networks --- Networks, Computer --- Teleprocessing networks --- Data transmission systems --- Digital communications --- Electronic systems --- Information networks --- Telecommunication --- Cyberinfrastructure --- Network computers --- Abstract automata --- Abstract machines --- Automata --- Mathematical machine theory --- Algorithms --- Logic, Symbolic and mathematical --- Recursive functions --- Robotics --- Foundations --- Distributed processing --- Computer science --- Mathematics.
Choose an application
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.
Mathematical logic --- Algebra --- Complex analysis --- Discrete mathematics --- Computer science --- Computer architecture. Operating systems --- Computer. Automation --- algebra --- complexiteit --- discrete wiskunde --- complexe analyse (wiskunde) --- bedrijfssoftware --- computers --- informatica --- database management --- wiskunde --- programmatielogica --- logica --- computerkunde
Choose an application
This book constitutes the refereed proceedings of the 13th International Conference on Combinatorics on Words, WORDS 2021, held virtually in September 2021. The 14 revised full papers presented in this book together with 2 invited talks were carefully reviewed and selected from 18 submissions. WORDS is the main conference series devoted to the mathematical theory of words. In particular, the combinatorial, algebraic and algorithmic aspects of words are emphasized. Motivations may also come from other domains such as theoretical computer science, bioinformatics, digital geometry, symbolic dynamics, numeration systems, text processing, number theory, etc.
Discrete mathematics --- Computer science --- Computer architecture. Operating systems --- Computer. Automation --- NLP (neurolinguïstisch programmeren) --- discrete wiskunde --- informatica --- algoritmen --- computernetwerken
Choose an application
This book constitutes the refereed proceedings of the 27th International Symposium on String Processing and Information Retrieval, SPIRE 2021, held in Lille, France, in October 2021.* The 14 full papers and 4 short papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 30 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology. *The symposium was held virtually.
Information retrieval --- Computer science --- Programming --- Computer architecture. Operating systems --- Information systems --- Artificial intelligence. Robotics. Simulation. Graphics --- Computer. Automation --- applicatiebeheer --- apps --- informatica --- informatiesystemen --- wiskunde --- KI (kunstmatige intelligentie) --- architectuur (informatica)
Choose an application
This book constitutes the refereed proceedings of the 27th International Symposium on String Processing and Information Retrieval, SPIRE 2021, held in Lille, France, in October 2021.* The 14 full papers and 4 short papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 30 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology. *The symposium was held virtually.
Data compression (Computer science) --- Compression of data (Computer science) --- Compression of files (Computer science) --- Compression of text (Computer science) --- File compression (Computer science) --- Text compression (Computer science) --- Coding theory --- Database management --- File organization (Computer science) --- Data compression (Telecommunication) --- Information storage and retrieval systems. --- Artificial intelligence. --- Application software. --- Computer science—Mathematics. --- Information Storage and Retrieval. --- Artificial Intelligence. --- Computer and Information Systems Applications. --- Mathematics of Computing. --- Application computer programs --- Application computer software --- Applications software --- Apps (Computer software) --- Computer software --- AI (Artificial intelligence) --- Artificial thinking --- Electronic brains --- Intellectronics --- Intelligence, Artificial --- Intelligent machines --- Machine intelligence --- Thinking, Artificial --- Bionics --- Cognitive science --- Digital computer simulation --- Electronic data processing --- Logic machines --- Machine theory --- Self-organizing systems --- Simulation methods --- Fifth generation computers --- Neural computers --- Automatic data storage --- Automatic information retrieval --- Automation in documentation --- Computer-based information systems --- Data processing systems --- Data storage and retrieval systems --- Discovery systems, Information --- Information discovery systems --- Information processing systems --- Information retrieval systems --- Machine data storage and retrieval --- Mechanized information storage and retrieval systems --- Computer systems --- Electronic information resources --- Data centers --- Digital libraries --- Information organization --- Information retrieval --- Computer science --- Mathematics.
Choose an application
String matching is one of the oldest algorithmic techniques, yet still one of the most pervasive in computer science. The past 20 years have seen technological leaps in applications as diverse as information retrieval and compression. This copiously illustrated collection of puzzles and exercises in key areas of text algorithms and combinatorics on words offers graduate students and researchers a pleasant and direct way to learn and practice with advanced concepts. The problems are drawn from a large range of scientific publications, both classic and new. Building up from the basics, the book goes on to showcase problems in combinatorics on words (including Fibonacci or Thue-Morse words), pattern matching (including Knuth-Morris-Pratt and Boyer-Moore like algorithms), efficient text data structures (including suffix trees and suffix arrays), regularities in words (including periods and runs) and text compression (including Huffman, Lempel-Ziv and Burrows-Wheeler based methods).
Choose an application
Discrete mathematics --- Computer science --- Computer architecture. Operating systems --- Computer. Automation --- NLP (neurolinguïstisch programmeren) --- discrete wiskunde --- informatica --- algoritmen --- computernetwerken
Choose an application
Information retrieval --- Computer science --- Programming --- Computer architecture. Operating systems --- Information systems --- Artificial intelligence. Robotics. Simulation. Graphics --- Computer. Automation --- applicatiebeheer --- apps --- informatica --- informatiesystemen --- wiskunde --- KI (kunstmatige intelligentie) --- architectuur (informatica)
Choose an application
The book is intended for lectures on string processes and pattern matching in Master's courses of computer science and software engineering curricula. The details of algorithms are given with correctness proofs and complexity analysis, which make them ready to implement. Algorithms are described in a C-like language. The book is also a reference for students in computational linguistics or computational biology. It presents examples of questions related to the automatic processing of natural language, to the analysis of molecular sequences, and to the management of textual databases.
Computer algorithms. --- Matching theory. --- Computational biology.
Choose an application
Listing 1 - 10 of 11 | << page >> |
Sort by
|