Publications (19)
Discharging cartwheels
Neil Robertson, Daniel P. Sanders, Paul Seymour +1
In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article w…
The strong perfect graph theorem
Maria Chudnovsky, Neil Robertson, Paul Seymour +1
A graph G is perfect if for every induced subgraph H, the chromatic number of H equals the size of the largest complete subgraph of H, and G is Berge if no induced subgraph of G is…
Imbalance Robust Softmax for Deep Embeeding Learning
Hao Zhu, Yang Yuan, Guosheng Hu +2
Deep embedding learning is expected to learn a metric space in which features have smaller maximal intra-class distance than minimal inter-class distance. In recent years, one rese…
Excluding disjoint Kuratowski graphs
Neil Robertson, Paul Seymour
A graph is a ``-Kuratowski graph'' if it has exactly components, each isomorphic to or to . We prove that if a graph contains no -Kuratowski graph as a…
ParaCNN: Visual Paragraph Generation via Adversarial Twin Contextual CNNs
Shiyang Yan, Yang Hua, Neil Robertson
Image description generation plays an important role in many real-world applications, such as image retrieval, automatic navigation, and disabled people support. A well-developed t…
Permanents, Pfaffian orientations, and even directed circuits
Neil Robertson, P. D. Seymour, Robin Thomas
Given a 0-1 square matrix A, when can some of the 1's be changed to -1's in such a way that the permanent of A equals the determinant of the modified matrix? When does a real squar…
TDViT: Temporal Dilated Video Transformer for Dense Video Tasks
Guanxiong Sun, Yang Hua, Guosheng Hu +1
Deep video models, for example, 3D CNNs or video transformers, have achieved promising performance on sparse video tasks, i.e., predicting one result per video. However, challenges…
Reducibility in the Four-Color Theorem
Neil Robertson, Daniel P. Sanders, Paul Seymour +1
In [J. Combin. Theory Ser. B 70 (1997), 2-44] we gave a simplified proof of the Four-Color Theorem. The proof is computer-assisted in the sense that for two lemmas in the article w…
Excluding sums of Kuratowski graphs
Neil Robertson, Paul Seymour
We prove that a graph does not contain as a minor a graph formed by 0-, 1-, 2- or 3-summing copies of or , if and only if it has bounded genus.
Efficient One-stage Video Object Detection by Exploiting Temporal Consistency
Guanxiong Sun, Yang Hua, Guosheng Hu +1
Recently, one-stage detectors have achieved competitive accuracy and faster speed compared with traditional two-stage detectors on image data. However, in the field of video object…
Excluded minors in cubic graphs
Neil Robertson, Paul Seymour, Robin Thomas
Let G be a cubic graph, with girth at least five, such that for every partition X,Y of its vertex set with |X|,|Y|>6 there are at least six edges between X and Y. We prove that if…
Deep Stock Representation Learning: From Candlestick Charts to Investment Decisions
Guosheng Hu, Yuxin Hu, Kai Yang +8
We propose a novel investment decision strategy (IDS) based on deep learning. The performance of many IDSs is affected by stock similarity. Most existing stock similarity measureme…
Instance Cross Entropy for Deep Metric Learning
Xinshao Wang, Elyor Kodirov, Yang Hua +1
Loss functions play a crucial role in deep metric learning thus a variety of them have been proposed. Some supervise the learning process by pairwise or tripletwise similarity cons…
Linkless embeddings of graphs in -space
Neil Robertson, Paul Seymour, Robin Thomas
We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bou…
Cyclically five-connected cubic graphs
Neil Robertson, P. D. Seymour, Robin Thomas
A cubic graph is cyclically 5-connected if is simple, 3-connected, has at least 10 vertices and for every set of edges of size at most four, at most one component of $G…
IEGAN: Multi-purpose Perceptual Quality Image Enhancement Using Generative Adversarial Network
Soumya Shubhra Ghosh, Yang Hua, Sankha Subhra Mukherjee +1
Despite the breakthroughs in quality of image enhancement, an end-to-end solution for simultaneous recovery of the finer texture details and sharpness for degraded images with low…
Excluding A Grid Minor In Planar Digraphs
Thor Johnson, Neil Robertson, Paul Seymour +1
In [Directed tree-width, J. Combin. Theory Ser. B 82 (2001), 138-154] we introduced the notion of tree-width of directed graphs and presented a conjecture, formulated during discus…
MAMBA: Multi-level Aggregation via Memory Bank for Video Object Detection
Guanxiong Sun, Yang Hua, Guosheng Hu +1
State-of-the-art video object detection methods maintain a memory structure, either a sliding window or a memory queue, to enhance the current frame using attention mechanisms. How…
Girth six cubic graphs have Petersen minors
Neil Robertson, Paul Seymour, Robin Thomas
We prove that every 3-regular graph with no circuit of length less than six has a subgraph isomorphic to a subdivision of the Petersen graph.