Kirjojen hintavertailu. Mukana 12 390 323 kirjaa ja 12 kauppaa.
Kirja.info

Kirjahaku

Etsi kirjoja tekijän nimen, kirjan nimen tai ISBN:n perusteella.

1000 tulosta hakusanalla Maxime Rodinson

An Introduction to the Study of Integral Equations

An Introduction to the Study of Integral Equations

Maxime Bocher

Cambridge University Press
2015
pokkari
First published in 1914, as the second edition of a 1909 original, this book forms number ten in the Cambridge Tracts in Mathematics and Mathematical Physics series. It was written to provide readers with 'the main portions of the theory of integral equations in a readable and, at the same time, accurate form, following roughly the lines of historical development'. Textual notes are incorporated throughout. This book will be of value to anyone with an interest in integral equations and the history of mathematics.
Vertaile hintoja
125 Problems in Text Algorithms

125 Problems in Text Algorithms

Maxime Crochemore; Thierry Lecroq; Wojciech Rytter

Cambridge University Press
2021
pokkari
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).
Vertaile hintoja
125 Problems in Text Algorithms

125 Problems in Text Algorithms

Maxime Crochemore; Thierry Lecroq; Wojciech Rytter

Cambridge University Press
2021
sidottu
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).
Vertaile hintoja
1...89101112...50