Unlocking the potential for linear and discrete optimisation in knot theory and computational topology. Computational topology is a young, energetic field that uses computers to solve complex geometric problems, such as whether a loop of string is tangled. Such computations are becoming increasingly important in mathematics, and applications span biology, physics and information sciences, however many core problems in the field remain intractable for all but the simplest cases. This project unit ....Unlocking the potential for linear and discrete optimisation in knot theory and computational topology. Computational topology is a young, energetic field that uses computers to solve complex geometric problems, such as whether a loop of string is tangled. Such computations are becoming increasingly important in mathematics, and applications span biology, physics and information sciences, however many core problems in the field remain intractable for all but the simplest cases. This project unites geometric techniques with powerful methods from operations research, such as linear and discrete optimisation, to build fast, powerful tools that can for the first time systematically solve large topological problems. Theoretically, this project has significant impact on the famous open problem of detecting knottedness in fast polynomial time.Read moreRead less
Tractable topological computing: Escaping the hardness trap. Computational topology is a young and energetic field that uses computers to solve complex geometric problems driven by pure mathematics, and with diverse applications in biology, signal processing and data mining. A major barrier is that many of these problems are thought to be fundamentally and intractably hard. This project aims to defy such barriers for typical real-world inputs by fusing geometric techniques with technologies from ....Tractable topological computing: Escaping the hardness trap. Computational topology is a young and energetic field that uses computers to solve complex geometric problems driven by pure mathematics, and with diverse applications in biology, signal processing and data mining. A major barrier is that many of these problems are thought to be fundamentally and intractably hard. This project aims to defy such barriers for typical real-world inputs by fusing geometric techniques with technologies from the field of parameterised complexity, creating powerful, practical solutions for these problems. It is expected to shed much-needed light on the vast and puzzling gap between theory and practice, and give researchers fast new software tools for large-scale experimentation and cutting-edge computer proofs.Read moreRead less
Generic complexity in computational topology: breaking through the bottlenecks. The project will focus on key computational problems in three-dimensional topology, with the aims of illuminating the theoretical limitations of such problems, developing new computational tools for solving them, and applying these tools to a variety of applications. The project will generate theoretical research, practical software, and rich experimental data.
Scalable biocomputing on networks: design and mathematical foundations. This project aims to develop technology with the potential to disrupt computation by providing a way to solve combinatorial mathematical problems in an efficient manner. Electronic computers have revolutionised our lives over the last half-century, but there are tasks they can not do, usually those requiring multi-tasking, much as our brains do. This project aims to overcome some of these problems by physically using molecul ....Scalable biocomputing on networks: design and mathematical foundations. This project aims to develop technology with the potential to disrupt computation by providing a way to solve combinatorial mathematical problems in an efficient manner. Electronic computers have revolutionised our lives over the last half-century, but there are tasks they can not do, usually those requiring multi-tasking, much as our brains do. This project aims to overcome some of these problems by physically using molecular parts of living things moving within specially mathematically designed networks to solve, in parallel, "combinatorial" mathematical problems that vex traditional computers, while using far less energy than electronic devices. This project expects to develop this nascent field into a practically useful, disruptive technology based in Australia.Read moreRead less
Algorithmic engineering and complexity analysis of protocols for consensus. Opinions, rankings, observations, votes, gene sequences, sensor-networks in security systems or climate models. Massive datasets and the ability to share information at unprecedented speeds, makes finding the most central representative, the Consensus Problem, extremely complex. This research delivers new insights and new, efficient algorithms.
Australian Laureate Fellowships - Grant ID: FL110100281
Funder
Australian Research Council
Funding Amount
$2,777,066.00
Summary
Large-scale statistical machine learning. This research program aims to develop the science behind statistical decision problems as varied as web retrieval, genomic data analysis and financial portfolio optimisation. Advances will have a very significant practical impact in the many areas of science and technology that need to make sense of large, complex data streams.