We show that if the Boolean hierarchy collapses to level k, then the polynomial hierarchy collapses to BH3(k), where BH3(k) is the kth level of the Boolean hierarchy over P 2 . Th...
—Peer-to-Peer streaming support for 3D content (i.e., P2P 3D streaming) has recently been proposed to provide affordable and real-time virtual environment (VE) content delivery. ...
The diameter of an undirected graph is the minimal number d such that there is a path between any two vertices of the graph of length at most d. The radius of a graph is the minim...
Edith Hemaspaandra, Lane A. Hemaspaandra, Till Tan...
This paper presents a general solution to the determination of the pose of a perspective camera with unknown focal length from images of four 3D reference points. Our problem is a...
We consider the DIRECTED STEINER NETWORK problem, also called the POINT-TO-POINT CONNECTION problem, where given a directed graph G and p pairs {(s1,t1),...,(sp,tp)} of nodes in t...