We study the following problem: Given a set V of n vertices and a set E of m edge pairs, we define a graph family G(V, E) as the set of graphs that have vertex set V and contain ...
The programmable service for Internet telephony (VoIP) allows end-users or third parties to define their own customized services. However, it imposes a serious drawback that serv...
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
We present a vision system for the 3-D modelbased tracking of unconstrained human movement. Using image sequences acquired simultaneously from multiple views, we recover the 3-D b...
Abstract. We propose a generative approach to the problem of labeling images containing configurations of objects from multiple classes. The main building blocks are dense statisti...