6437 search results - page 437 / 1288 » Parallel Algorithms for Arrangements |
201
click to vote
FOCS
2000
IEEE
15 years 12 months ago
2000
IEEE
We give new bounds on the circuit complexity of the quantum Fourier transform (QFT). We give an upper bound of Ç´ÐÓ Ò · ÐÓ ÐÓ ´½ µµ on the circuit depth for computin...
204
click to vote
COR
2006
15 years 7 months ago
2006
This paper considers the problem of scheduling two-operation non-preemptable jobs on two identical semiautomatic machines. A single server is available to carry out the first (or ...
172
click to vote
IPPS
2009
IEEE
16 years 2 months ago
2009
IEEE
Abstract—In this paper we consider the problem of constructing minimal cycle-breaking sets of turns for graphs that model communication networks, as a method to prevent deadlocks...
221
Voted
CVPR
2008
IEEE
16 years 9 months ago
2008
IEEE
We present a theoretical analysis for characterizing the shadows cast by a point light source given its relative position to the camera. In particular, we analyze the epipolar geo...
193
Voted
ICCV
1999
IEEE
16 years 9 months ago
1999
IEEE
The notion of a virtual sensor for optimal 3D reconstruction is introduced. Instead of planar perspective images that collect many rays at a fixed viewpoint, omnivergent cameras c...