2924 search results - page 286 / 585 » Lower Bounds in Distributed Computing |
131
click to vote
IWPEC
2009
Springer
15 years 11 months ago
2009
Springer
We study the parameterized complexity of the following fundamental geometric problems with respect to the dimension d: i) Given n points in Rd, compute their minimum enclosing cyl...
132
click to vote
SI3D
2003
ACM
15 years 9 months ago
2003
ACM
Shadow mapping is a technique for doing real-time shadowing. Recent work has shown that shadow mapping hardware can be used as a second depth test in addition to the z-test. In th...
165
click to vote
DAC
1997
ACM
15 years 8 months ago
1997
ACM
We present a system-level approach for power optimization under a set of user specified costs and timing constraints of hard real-time designs. The approach optimizes all three d...
120
click to vote
ICRA
1994
IEEE
15 years 8 months ago
1994
IEEE
We study the problem of computing the set F of accessible and stable placements of a spider robot. The body of this robot is a single point and the legs are line segments attached...
119
click to vote
ASPDAC
2005
ACM
15 years 6 months ago
2005
ACM
— The pressure of fundamental limits on classical computation and the promise of exponential speedups from quantum effects have recently brought quantum circuits to the attention...