1523 search results - page 50 / 305 » The Computational Complexity of Linear Optics |
119
Voted
STOC
1996
ACM
15 years 7 months ago
1996
ACM
We study the complexity of computing Boolean functions using AND, OR and NOT gates. We show that a circuit of depth d with S gates can be made to output a constant by setting O(S1...
156
Voted
FOSSACS
2011
Springer
14 years 7 months ago
2011
Springer
The model checking of higher-order recursion schemes has been actively studied and is now becoming a basis of higher-order program verification. We propose a new algorithm for tri...
104
click to vote
ICPR
2008
IEEE
15 years 10 months ago
2008
IEEE
The locally linear embedding (LLE) algorithm is considered as a powerful method for the problem of nonlinear dimensionality reduction. In this paper, first, a new method called cl...
130
Voted
RT
1995
Springer
15 years 7 months ago
1995
Springer
Multiple scattering in participating media is generally a complex phenomenon. In the limit of an optically thick medium, i.e., when the mean free path of each photon is much smalle...
154
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
: In this paper, inspired by the work of Megiddo on the formation of preferences and strategic analysis, we consider an early market model studied in the field of economic theory, ...