Home      Discussions      About
Join us

@sydney.edu.au

May 12, 2017
By jz960
Computer Vision

Recent Advances in Transfer Learning for Cross-Dataset Visual Recog…

This paper takes a problem-oriented perspective and presents a comprehensive review of transfer learning methods, both shallow and deep, for cross-da…
Sep 15, 2013
Information Theory

The Incidence and Cross Methods for Efficient Radar Detection

The designation of the radar system is to detect the position and velocity of targets around us. The radar transmits a waveform, which is reflected b…
Apr 10, 2019
Computation and Language
Artificial Intelligence
Machine Learning

BAG: Bi-directional Attention Entity Graph Convolutional Network for …

Multi-hop reasoning question answering requires deep comprehension of relationships between various documents and queries. We propose a Bi-directiona…
Apr 17, 2019
By li
Computer Vision
Multimedia

SCE: A manifold regularized set-covering method for data partitioning

Cluster analysis plays a very important role in data analysis. In these years, cluster ensemble, as a cluster analysis tool, has drawn much attention…
Aug 08, 2018
By jaco
Geometric Topology

On minimal ideal triangulations of cusped hyperbolic 3-manifolds

Previous work of the authors studies minimal triangulations of closed 3-manifolds using a characterisation of low degree edges, embedded layered soli…
May 20, 2017
By n.xu
Machine Learning
Statistics Theory

$\left( β, \varpi \right)$-stability for cross-validation and the c…

In this paper, we introduce a new concept of stability for cross-validation, called the $\left( \beta, \varpi \right)$-stability, and use it as a new…
Apr 12, 2014
By anmich
Probability

If p>1, then the process (Yt−EYt)t≥0 is an (Ft)-martingale and (2.3) and (2.4) follow easily. Let 0<p≤1. It has been proved in [8], see also [7] for a more general result, that E|Y1|p<∞ iff

Exponential ergodicity of semilinear equations driven by Lévy proce…

We study convergence to the invariant measure for a class of semilinear stochastic evolution equations driven by L\'evy noise, including the case of …
May 16, 2018
Cryptography and Security
Artificial Intelligence
Performance

Privacy Preservation in Location-Based Services: A Novel Metric and …

Recent years have seen rising needs for location-based services in our everyday life. Aside from the many advantages provided by these services, they…
Dec 13, 2017
Geometric Topology
Combinatorics

The trisection genus of standard simply connected PL 4-manifolds

Gay and Kirby recently introduced the concept of a trisection for arbitrary smooth, oriented closed 4-manifolds, and with it a new topological invari…
Aug 07, 2018
Machine Learning

Instance-Dependent PU Learning by Bayesian Optimal Relabeling

When learning from positive and unlabelled data, it is a strong assumption that the positive observations are randomly sampled from the distribution …
Aug 25, 2017
By swbae
Computational Geometry

Gap-planar Graphs

We introduce the family of $k$-gap-planar graphs for $k \geq 0$, i.e., graphs that have a drawing in which each crossing is assigned to one of the tw…
Oct 18, 2016
By n.xu
Machine Learning
Statistics Theory
Economics

Generalization error minimization: a new approach to model evaluation…

We study model evaluation and model selection from the perspective of generalization ability (GA): the ability of a model to predict outcomes in new …
Jul 06, 2017

Emergence of spatial curvature

This paper investigates the phenomenon of emergence of spatial curvature. This phenomenon is absent in the Standard Cosmological Model, which has a f…
Jun 22, 2018
Populations and Evolution

Thermodynamic efficiency of contagions: A statistical mechanical an…

We present a novel approach to the study of epidemics on networks as thermodynamic phenomena, considering the thermodynamic efficiency of contagions,…
Aug 12, 2014
Data Structures and Algorithms
Computational Geometry
Discrete Mathematics

Advances on Testing C-Planarity of Embedded Flat Clustered Graphs

We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.
Jun 26, 2019
Computer Vision

Deep Modular Co-Attention Networks for Visual Question Answering

Visual Question Answering (VQA) requires a fine-grained and simultaneous understanding of both the visual content of images and the textual content o…
Oct 16, 2014
Networking and Internet Architecture

Multi-Gigabits Millimetre Wave Wireless Communications for 5G: From …

With the formidable growth of various booming wireless communication services that require ever-increasing data throughputs, the conventional microwa…
Aug 11, 2014
Computational Geometry

Compatible Connectivity-Augmentation of Planar Disconnected Graphs

Motivated by applications to graph morphing, we consider the following \emph{compatible connectivity-augmentation problem}: We are given a labelled $…
Nov 21, 2018
Geometric Topology

What is a Singular Knot?

A singular knot is an immersed circle in $\mathbb R^{3}$ with finitely many transverse double points. The study of singular knots was initially motiv…
Apr 04, 2019
Information Retrieval

Triplet-Based Deep Hashing Network for Cross-Modal Retrieval

Given the benefits of its low storage requirements and high retrieval efficiency, hashing has recently received increasing attention. In particular,c…
There aren't more papers

Request Comment

or Invite via email
You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description