research
∙
05/02/2023
Complexity Framework for Forbidden Subgraphs IV: The Steiner Forest Problem
We study Steiner Forest on H-subgraph-free graphs, that is, graphs that ...
share
research
∙
05/01/2023
Complexity Framework for Forbidden Subgraphs III: When Problems are Tractable on Subcubic Graphs
For any finite set ℋ = {H_1,…,H_p} of graphs, a graph is ℋ-subgraph-free...
research
∙
11/23/2022
Complexity Framework For Forbidden Subgraphs
For any finite set ℋ = {H_1,…,H_p} of graphs, a graph is ℋ-subgraph-free...
research
∙
11/22/2022
Edge Multiway Cut and Node Multiway Cut are NP-complete on subcubic graphs
We show that Edge Multiway Cut (also called Multiterminal Cut) and Node ...
research
∙
10/20/2022
Photo-realistic 360 Head Avatars in the Wild
Delivering immersive, 3D experiences for human communication requires a ...
research
∙
08/01/2022
VolTeMorph: Realtime, Controllable and Generalisable Animation of Volumetric Representations
The recent increase in popularity of volumetric representations for scen...
research
∙
07/27/2022
Towards Mapping and Assessing Sidewalk Accessibility Across Sociocultural and Geographic Contexts
Despite the important role of sidewalks in supporting mobility, accessib...
research
∙
04/22/2022
You Only Linearize Once: Tangents Transpose to Gradients
Automatic differentiation (AD) is conventionally understood as a family ...
research
∙
04/06/2022
3D face reconstruction with dense landmarks
Landmarks often play a key role in face analysis, but many aspects of id...
research
∙
02/02/2022
Unified Scaling Laws for Routed Language Models
The performance of a language model has been shown to be effectively mod...
research
∙
09/30/2021
Fake It Till You Make It: Face analysis in the wild using synthetic data alone
We demonstrate that it is possible to perform face-related computer visi...
research
∙
04/12/2021
Getting to the Point. Index Sets and Parallelism-Preserving Autodiff for Pointful Array Programming
We present a novel programming language design that attempts to combine ...
research
∙
03/18/2021
FastNeRF: High-Fidelity Neural Rendering at 200FPS
Recent work on Neural Radiance Fields (NeRF) showed how neural networks ...
research
∙
07/28/2020
Computing Weighted Subset Transversals in H-Free Graphs
For the Odd Cycle Transversal problem, the task is to find a small set S...
research
∙
07/16/2020
A high fidelity synthetic face framework for computer vision
Analysis of faces is one of the core applications of computer vision, wi...
research
∙
06/26/2020
High Resolution Zero-Shot Domain Adaptation of Synthetically Rendered Face Images
Generating photorealistic images of human faces at scale remains a prohi...
research
∙
05/28/2020
Computing Subset Transversals in H-Free Graphs
We study the computational complexity of two well-known graph transversa...
research
∙
05/06/2020
CONFIG: Controllable Neural Face Image Generation
Our ability to sample realistic natural images, particularly faces, has ...
research
∙
04/16/2020
Steiner Trees for Hereditary Graph Classes: a Treewidth Perspective
We consider the classical problems (Edge) Steiner Tree and Vertex Steine...
research
∙
10/11/2019
On the Price of Independence for Vertex Cover, Feedback Vertex Set and Odd Cycle Transversal
Let vc(G), fvs(G) and oct(G), respectively, denote the size of a minimum...
research
∙
08/01/2019
On Cycle Transversals and Their Connected Variants in the Absence of a Small Linear Forest
A graph is H-free if it contains no induced subgraph isomorphic to H. We...
research
∙
07/29/2019
Towards Automatic Screening of Typical and Atypical Behaviors in Children With Autism
Autism spectrum disorders (ASD) impact the cognitive, social, communicat...
research
∙
01/02/2019
Clique-Width for Hereditary Graph Classes
Clique-width is a well-studied graph parameter owing to its use in under...
research
∙
11/29/2018
Graph Isomorphism for (H_1,H_2)-free Graphs: An Almost Complete Dichotomy
We consider the Graph Isomorphism problem for classes of graphs characte...
research
∙
11/05/2018
Simple, Distributed, and Accelerated Probabilistic Programming
We describe a simple, low-level approach for embedding probabilistic pro...
research
∙
08/10/2018
Finding a Small Number of Colourful Components
A partition (V_1,...,V_k) of the vertex set of a graph G with a (not nec...
research
∙
03/15/2018
Capturing Structure Implicitly from Time-Series having Limited Data
Scientific fields such as insider-threat detection and highway-safety pl...
research
∙
12/22/2017
Connected Vertex Cover for (sP_1+P_5)-Free Graphs
The Connected Vertex Cover problem is to decide if a graph G has a verte...
research
∙
06/25/2017
Minimum Connected Transversals in Graphs: New Hardness Results and Tractable Cases Using the Price of Connectivity
We perform a systematic study in the computational complexity of the con...
research
∙
07/22/2016
Hereditary Graph Classes: When the Complexities of Colouring and Clique Cover Coincide
A graph is (H_1,H_2)-free for a pair of graphs H_1,H_2 if it contains no...
research
∙
02/20/2016
The Segmented iHMM: A Simple, Efficient Hierarchical Infinite HMM
We propose the segmented iHMM (siHMM), a hierarchical infinite hidden Ma...
research
∙
11/12/2015
Efficient non-greedy optimization of decision trees
Decision trees and randomized forests are widely used in computer vision...
research
∙
06/22/2015
Filling the Complexity Gaps for Colouring Planar and Bounded Degree Graphs
We consider a natural restriction of the List Colouring problem: k-Regul...
research
∙
01/23/2015
A Reconfigurations Analogue of Brooks' Theorem and its Consequences
Let G be a simple undirected graph on n vertices with maximum degree Δ. ...
research
∙
03/25/2014