Papers by Paul Bonnington
Bookmarks Related papers MentionsView impact
Ars Combinatoria, 2004
Bookmarks Related papers MentionsView impact
arXiv (Cornell University), Apr 6, 2022
Bookmarks Related papers MentionsView impact
Springer eBooks, 1995
ABSTRACT
Bookmarks Related papers MentionsView impact
Discrete Mathematics & Theoretical Computer Science, 1996
ABSTRACT
Bookmarks Related papers MentionsView impact
Australas. J Comb., 1994
Bookmarks Related papers MentionsView impact
Australas. J Comb., 1992
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
American Mathematical Society eBooks, Apr 29, 1993
DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 9. 1993 A Generalis... more DIMACS Series in Discrete Mathematics and Theoretical Computer Science Volume 9. 1993 A Generalisation of MacLane's Theorem to 3-Graphs C. PAUL BONNINGTON AND CHARLES HC LITTLE July 31. 1992 ABSTRACT. A 3-graph is a cubic graph endowed with a proper ...
Bookmarks Related papers MentionsView impact
Lecture Notes in Computer Science
Bookmarks Related papers MentionsView impact
IEEE Transactions on Medical Imaging
Bookmarks Related papers MentionsView impact
CERN European Organization for Nuclear Research - Zenodo, Jul 18, 2022
Bookmarks Related papers MentionsView impact
Cornell University - arXiv, Sep 13, 2022
Bookmarks Related papers MentionsView impact
computing infrastructure: applications in neuroscience and
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Bookmarks Related papers MentionsView impact
Proceedings of the AAAI Conference on Artificial Intelligence
Given the incomplete knowledge of classes that exist in the world, Open-set Recognition (OSR) ena... more Given the incomplete knowledge of classes that exist in the world, Open-set Recognition (OSR) enables networks to identify and reject the unseen classes after training. This problem of breaking the common closed-set assumption is far from being solved. Recent studies focus on designing new losses, neural network encoding structures, and calibration methods to optimize a feature space for OSR relevant tasks. In this work, we make the first attempt to tackle OSR by searching the architecture of a Neural Network (NN) under the open-set assumption. In contrast to the prior arts, we develop a mechanism to both search the architecture of the network and train a network suitable for tackling OSR. Inspired by the compact abating probability (CAP) model, which is theoretically proven to reduce the open space risk, we regularize the searching space by VAE contrastive learning. To discover a more robust structure for OSR, we propose Pseudo Auxiliary Searching (PAS), in which we split a pretend...
Bookmarks Related papers MentionsView impact
Journal of Combinatorial Theory, Series B, 2004
Bookmarks Related papers MentionsView impact
The need for comprehensive and automated screening methods for retinal image classification has l... more The need for comprehensive and automated screening methods for retinal image classification has long been recognized. Well-qualified doctors annotated images are very expensive and only a limited amount of data is available for various retinal diseases such as age-related macular degeneration (AMD) and diabetic retinopathy (DR). Some studies show that AMD and DR share some common features like hemorrhagic points and exudation but most classification algorithms only train those disease models independently. Inspired by knowledge distillation where additional monitoring signals from various sources is beneficial to train a robust model with much fewer data. We propose a method called synergic adversarial label learning (SALL) which leverages relevant retinal disease labels in both semantic and feature space as additional signals and train the model in a collaborative manner. Our experiments on DR and AMD fundus image classification task demonstrate that the proposed method can signifi...
Bookmarks Related papers MentionsView impact
A planar digraph D is clustered planar if in some planar embedding of D we have at each vertex th... more A planar digraph D is clustered planar if in some planar embedding of D we have at each vertex the in-arcs occurring sequentially in the local rotation. By supplementing the operations used to form the usual minors in Kuratowski’s theorem, clustered planar digraphs are characterised.
Bookmarks Related papers MentionsView impact
Uploads
Papers by Paul Bonnington