Sciweavers

1523 search results - page 16 / 305
» The Computational Complexity of Linear Optics
Sort
View
DAM
2008
102views more  DAM 2008»
15 years 3 months ago
On the computational complexity of partial covers of Theta graphs
By use of elementary geometric arguments we prove the existence of a special integral solution of a certain system of linear equations. The existence of such a solution yields the...
Jirí Fiala, Jan Kratochvíl, Attila P...
98
Voted
IPPS
2000
IEEE
15 years 8 months ago
Present and Future Needs of Free-Space Optical Interconnects
Over the last decade significant progress in optoelectronic devices and their integration techniques have made Free-Space Optical Interconnects (FSOI) one of the few physical appro...
Sadik C. Esener, Philippe J. Marchand
116
Voted
CCA
2009
Springer
15 years 10 months ago
Real Computation with Least Discrete Advice: A Complexity Theory of Nonuniform Computability
It is folklore particularly in numerical and computer sciences that, instead of solving some general problem f : A → B, additional structural information about the input x ∈ A ...
Martin Ziegler
133
Voted
SIGGRAPH
1992
ACM
15 years 7 months ago
Predicting reflectance functions from complex surfaces
We describe a physically-based Monte Carlo technique for approximating bidirectional reflectance distribution functions (BRDFs) for a large class of geometries by directly simulat...
Stephen H. Westin, James Arvo, Kenneth E. Torrance
151
Voted
HAPTICS
2009
IEEE
15 years 10 months ago
Haptic rendering of complex deformations through handle-space force linearization
The force-update-rate requirements of transparent rendering of virtual environments are in conflict with the computational cost required for computing complex interactions betwee...
Carlos Garre, Miguel A. Otaduy