I need one. I have a source string of generaly unknown (although known to be less than 100 characters) content, and I need to match it against a 5mb file of likewise-arranged strings (all less ...

Dynamic stochastic matching problems arise in a variety of recent applications, ranging from ridesharing and online video games to kidney exchange. Such problems are naturally formulated as Markov ...

On Friday, 19th of February 2021, M.Sc. Pengfei Xu defended his doctoral thesis Efficient Approximate String Matching with Synonyms and Taxonomies. The event has invited Professor Jiaheng Lu ...

On Friday the 19th of February 2021, M.Sc. Pengfei Xu will defend his doctoral thesis on Efficient Approximate String Matching with Synonyms and Taxonomies. The thesis is related to research done in ...