A class C of graphs is said to be H-bounded if each graph in the class C admits a homomorphism to H. We give a general necessary and sufficient condition for the existence of boun...
Timothy Marshall, Reza Nasraser, Jaroslav Nesetril
Several techniques have been developed to approximate Bidirectional Reflectance Distribution Functions (BRDF) with acceptable quality and performance for realtime applications. Th...
This paper introduces accumulation into list homomorphisms for systematic development of both efficient and correct parallel programs. New parallelizable recursive pattern called...
Abstract. In this paper we study dualities of graphs and, more generally, relational structures with respect to full homomorphisms, that is, mappings that are both edge- and non-ed...
Abstract— We consider the problem of apprenticeship learning when the expert’s demonstration covers only a small part of a large state space. Inverse Reinforcement Learning (IR...