This month we look at some uses of rolling hashes for string comparison and compression focussing on the rsync protocol, a spam filter, and a delta compression technique. We also enjoy a talk on Mixture of Markov Chains.
Rolling hashes are fast to compute and can be used to identify 'similar' strings in blocks of data. This talk will look at some uses of rolling hashes for string comparison and compression focussing on the rsync protocol, a spam filter, and a delta compression technique.
John Graham-Cumming is a computer programmer and author. He studied mathematics and computation at Oxford and stayed for a doctorate in computer security. As a programmer he has worked in Silicon Valley and New York, the UK, Germany and France and cu
In this talk I will describe the representation of Mixture of Markov Chains as a graphical model, how it relates to other probabilistic models, how to estimate its parameters via Expectation-Maximization, and how to use for clustering, data generation, density estimation and missing data completion.
Jose Llarena has been writing intelligent software since 2001 in a variety of industries including fraud detection and e-learning. He has obtained AI-related degrees from the Universities of Sussex and Edinburgh and is an active member of the London
Sorry, no member has joined this event so far.