140 search results - page 22 / 28 » P3 |
COCO
1990
Springer
14 years 19 days ago
1990
Springer
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...
IJAMC
2010
13 years 7 months ago
2010
—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. ...
FCT
2007
Springer
13 years 10 months ago
2007
Springer
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...
CVPR
2008
IEEE
14 years 10 months ago
2008
IEEE
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...
FOCS
1999
IEEE
14 years 27 days ago
1999
IEEE
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...