1523 search results - page 180 / 305 » The Computational Complexity of Linear Optics |
161
click to vote
GD
2003
Springer
15 years 11 months ago
2003
Springer
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
133
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
We study auctions with severe bounds on the communication allowed: each bidder may only transmit t bits of information to the auctioneer. We consider both welfare- and profit-max...
152
click to vote
ICCV
1999
IEEE
15 years 10 months ago
1999
IEEE
This paper deals with the concept of auto-calibration, i.e. methods to calibrate a camera on-line. In particular, we deal with minimal conditions on the intrinsic parameters neede...
132
click to vote
IPPS
1998
IEEE
15 years 10 months ago
1998
IEEE
We present a method by which any polynomial-time randomized distributed algorithm is transformed in such way that each participating process needs only polylog local random bits a...
178
click to vote
COMPGEOM
1998
ACM
15 years 10 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...