Michael Horton

Michael Horton has written 3 posts for Sydney algorithms group

SACT Seminar: Hung-Lung Wang

Time: Thursday 31 August, 10–11am. Location: “Common Area” of level 4W. Speaker: Hung-Lung Wang, National Taipei University of Business. Title: Convexity on AT-free graphs Abstract: We deal with the anti-exchange property with respect to a kind of graph convexity. We show that the property holds if and only if the graph under consideration isAT-free. An application to generating theATfree … Continue reading

SACT Seminar

Time: 1:00 pm Tuesday, 15th August 2017. Location: SIT 459 Speaker: Hubert Chan, The University of Hong Kong Title: Revisiting Diffusion Process for Hypergraph Laplacian Abstract: Hypergraph Laplacian has been defined via a diffusion process [Louis STOC 2015].  The spectral properties of the Laplacian is used to achieve a variant of the Cheeger’s inequality for hyperedge expansion and … Continue reading

SACT Seminar

Time: 1:00 pm Tuesday, 16th May 2017. Location: SIT 459 Speaker: Nengkun Yu, University of Technology Sydney Title: Learning classical information in Quantum system—from Pretty Good Measurement to Pretty Good Tomography Abstract: We start with a promise problem of extracting information from a single quantum system whose state is known to be in one of several possible … Continue reading

Enter your email address to subscribe to receive notifications of new announcements by email.

Join 68 other followers