A perfect matching in a 4-uniform hypergraph on n vertices is a subset of ? n 4 ? disjoint edges. We prove that if H is a sufficiently large 4-uniform hypergraph on n = 4 k vertices such that every… Expand

We propose a novel computational framework that uses general similarity metrics and distance-preserving embeddings with string kernels to improve sequence classification.Expand

In this work, we propose streaming algorithms to efficiently approximate descriptors by estimating counts of sub-graphs of order \documentclass[12pt]{minimal} \usepackage{amsmath} through Budgeted Estimates, and thereby devise extensions of two existing graph comparison paradigms.Expand

We propose a novel computational framework that uses general similarity metrics S(·, ·) and distance-preserving embeddings with string kernels to improve sequence classification.Expand