— We study the end-to-end resource allocation in an OFDM based multi-hop network consisting of a one-dimensional chain of nodes including a source, a destination, and multiple re...
In a finite simple undirected graph, a vertex is simplicial if its neighborhood is a clique. We say that, for k 2, a graph G = (VG, EG) is the k-simplicial power of a graph H = (V...
This paper presents a novel approach for model-based realtime tracking of highly articulated structures such as humans. This approach is based on an algorithm which efficiently pr...
Persistent homology is the mathematical core of recent work on shape, including reconstruction, recognition, and matching. Its pertinent information is encapsulated by a pairing o...
David Cohen-Steiner, Herbert Edelsbrunner, Dmitriy...
Efficient and expressive comparison of sequences is an essential procedure for learning with sequential data. In this article we propose a generic framework for computation of sim...