1.4k citations
- The University of MelbourneAU14 papers
- Monash UniversityAU13 papers
- Curtin UniversityAU11 papers
- National Institute for Materials ScienceJP11 papers
- Queen's University BelfastGB10 papers
- RMIT UniversityAU9 papers
- Swinburne University of TechnologyAU9 papers
- The University of SydneyAU9 papers
- Commonwealth Scientific and Industrial Research OrganisationAU7 papers
- UNSW SydneyAU7 papers
- Wenzhou UniversityCN6 papers
- Australian SynchrotronAU5 papers
60 papers · 1 filter
Performance Analysis of 2-Step Random Access with CDMA in Machine-Type Communication
Jinho Choi
There is a growing interest in the transition from 4-step random access to 2-step random access in machine-type communication (MTC), since 2-step random access is well-suited to sh…
Requirements of API Documentation: A Case Study into Computer Vision Services
Alex Cummaudo, Rajesh Vasa, John Grundy +1
Using cloud-based computer vision services is gaining traction, where developers access AI-powered components through familiar RESTful APIs, not needing to orchestrate large traini…
A hybrid deep-learning approach for complex biochemical named entity recognition
Jian Liu, Lei Gao, Sujie Guo +6
Named entity recognition (NER) of chemicals and drugs is a critical domain of information extraction in biochemical research. NER provides support for text mining in biochemical re…
DistB-Condo: Distributed Blockchain-based IoT-SDN Model for Smart Condominium
Anichur Rahman, Md. Jahidul Islam, Ziaur Rahman +5
Condominium network refers to intra-organization networks, where smart buildings or apartments are connected and share resources over the network. Secured communication platform or…
High Dimensional Level Set Estimation with Bayesian Neural Network
Huong Ha, Sunil Gupta, Santu Rana +1
Level Set Estimation (LSE) is an important problem with applications in various fields such as material design, biotechnology, machine operational testing, etc. Existing techniques…
Linkedness of Cartesian products of complete graphs
Leif K. Jorgensen, Guillermo Pineda-Villavicencio, Julien Ugon
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with at least vertices is {\it -linked} if, for every set of distinct ver…