糖心TV Complexity Science Events
Complexity Centre and MathSys CDT events carry priority over room D1.07.
To book D1.07 please email Sheetal dot Sharma at warwick dot ac dot uk
Please note that your event booking is for D1.07 only. The adjacent common room is a private area for the MathSys Centre that cannot used as part of your booking.
Complexity Forum: Miranda Mowbray (HP Labs)
Speaker: Miranda Mowbray (HP Labs)
Title: Faster detection of attacks on computer networks
Abstract:
A common problem in analyzing data from a complex network is that you have a pattern (written in a standard “regular expression” format), and you want to quickly find all the matches to this pattern in a large set of data items, and to report back parts of the matches to the pattern. This kind of pattern matching is used, for example, to detect attacks on computer networks. I’ll describe the usual ways of solving this problem, which are very fast for small or simple patterns, but can take an impractically long time for some complicated patterns. Then I’ll describe a new, faster way of doing this, developed with some colleagues at HP Labs.
Lunch: Group 1