This category contains 108 posts

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

SACT Seminar

Time: 1:00 pm Thursday, 6th of April 2017. Location: SIT 459 Speaker: Patrick Eades Title: Stochastic k-center and j-flats Abstract:  Patrick will present the paper “Stochastic k-center and j-flats” by Lingxiao Huang and Jian Li. “Solving geometric optimization problems over uncertain data have become increasingly important in many applications and have attracted a lot of attentions in recent years. In … Continue reading

SACT Seminar: Justified Representation in Approval- Based Committee Voting

Time: 1:00 pm Tuesday, 28th February 2017. Location: SIT 459 Speaker: Haris Aziz, Data61/CSIRO and UNSW Title: Justified Representation in Approval- Based Committee Voting Abstract: We consider approval-based committee voting, i.e. the setting where each voter approves a subset of candidates, and these votes are then used to select a fixed-size set of winners (committee). … Continue reading

SACT Seminar: Computing the Yolk in Spatial Voting Games

Time: 1:00 pm Wednesday, 22nd February 2017. Location: SIT 459 Speaker: Jonathan Chung, University of Sydney Title: Computing the Yolk in Spatial Voting Games Abstract: The spatial model of voting describes a set of voters with Euclidean preferences on a multidimensional space of policies. A game within this model can be played as follows: given … Continue reading

SACT Seminar: Reduction of the Radius of a Graph by Adding Edges

Time: 1:00 pm Tuesday, 14th February 2017. Location: SIT 459 Speaker: Michael Rizzuto, University of Sydney Title: Reduction of the Radius of a Graph by Adding Edges Abstract: Given a graph and a maximum number of extra edges, we wish to find the minimum radius achievable by adding these edges to the graph. A solution … Continue reading

SACT Seminar: Approximation Algorithms for 2D Barrier Coverage

Time: 1:00 pm Tuesday, 7th February 2017. Location: SIT 459 Speaker: Andrew Cherry, University of Sydney Title: Approximation Algorithms for 2D Barrier Coverage Abstract: Given barriers represented by line segments and sensors with circular radius initially located in arbitrary locations we want to move a group of sensors to arbitrary locations on the barriers so … Continue reading

SACT Seminar: Algorithms for robot navigation

Time: 11:00 am Friday, 16th December 2016. Location: SIT 459 Speaker: Prof. Sándor Fekete, TU Braunschweig Title: Algorithms for robot navigation: From optimizing individual robots to particle swarms Abstract: Planning and optimizing the motion of one or several robots poses a wide range of problems. What positions should one powerful robot pick to scan a … Continue reading

SACT Seminar: Colouring on hereditary graph classes

Time: 12:00 noon Tuesday, 8th November 2016. Location: SIT 459 Speaker: Shenwei Huang, UNSW Title: Colouring on hereditary graph classes Abstract: A graph class is hereditary if it is closed under taking induced subgraphs. It is known that hereditary classes can be characterized by forbidden induced subgraphs. We survey some recent complexity results on colouring … Continue reading

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

Join 68 other followers