Approximate structures for efficient processing of data streams. This project aims to increase the volume of streamed data that can be handled on a low-powered device with limited memory. In finance, health, and transport, data arrives at enormous rates, and data-driven decisions must be made quickly. Likewise, to keep Australia secure, national agencies monitor and gather vast data sets. Increasingly, devices and monitors that have limited resources are making these decisions and they require c ....Approximate structures for efficient processing of data streams. This project aims to increase the volume of streamed data that can be handled on a low-powered device with limited memory. In finance, health, and transport, data arrives at enormous rates, and data-driven decisions must be made quickly. Likewise, to keep Australia secure, national agencies monitor and gather vast data sets. Increasingly, devices and monitors that have limited resources are making these decisions and they require computational techniques that run extremely efficiently. The project expects to develop and improve approximate data structures that operate in tight resource bounds. Anticipated outcomes are improved event recognition and dramatic speedup in analysis of streams in areas such as finance, health, transport, and urban data.Read moreRead less
Approximate algorithms and architectures for area efficient system design. This project aims to develop simpler but reliable image recognition systems that can run on low-cost, small-scale platforms, for use in driver monitoring system (DMS) applications. Cheaper reliable DMS will lead to wider availability of this technology to end users and improve safety of motor vehicles. This project will develop approximate algorithmic and circuit techniques, provide training for research students and buil ....Approximate algorithms and architectures for area efficient system design. This project aims to develop simpler but reliable image recognition systems that can run on low-cost, small-scale platforms, for use in driver monitoring system (DMS) applications. Cheaper reliable DMS will lead to wider availability of this technology to end users and improve safety of motor vehicles. This project will develop approximate algorithmic and circuit techniques, provide training for research students and build capability in the area of approximate computing. It is also expected to lead to commercial products, licences and revenue, which will enable new job creation.
Read moreRead less
Data retrieval from massive information structures. Information search is an essential tool. But most current services regard the data as unstructured collections of independent documents, free of context. Next-generation search applications, such as over social networks, or corporate websites, or XML data sets, must account for the inherent relationships between data items, and must allow the efficient inclusion of search context. Queries should favour semantically local data, giving results th ....Data retrieval from massive information structures. Information search is an essential tool. But most current services regard the data as unstructured collections of independent documents, free of context. Next-generation search applications, such as over social networks, or corporate websites, or XML data sets, must account for the inherent relationships between data items, and must allow the efficient inclusion of search context. Queries should favour semantically local data, giving results that depend on the perceived state of the querier. This project will develop indexing and search techniques for massive structured data sets. The new search methods will incorporate theoretical advances and will be experimentally validated using industry-standard open-source distributed systems.Read moreRead less
Efficient and effective algorithms for searching strings in secondary storage. Pattern searching is fundamental to a wide range of computing applications, including web search and bioinformatics. In this project we will develop compression algorithms and hybrid memory-disk search structures that allow fast pattern matching on sequences of textual and numeric data, including when approximate search is required.
On effectively modelling and efficiently discovering communities from large networks. Finding and maintaining close communities from very large scale, dynamically changing networks is interesting and challenging. This project aims to develop new techniques to identify such communities as fast as possible through exploiting the rich semantics and individual relationships within the communities.
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.
Algorithms and data structures to support automated analysis of trajectory data. The emergence of a variety of tracking devices, surveillance systems and even electronic transaction and phone networks has resulted in the production of large amounts of positional information for vehicles, people and animals. The aim of the project is to develop tools that support automated analysis of such data sets.