1523 search results - page 117 / 305 » The Computational Complexity of Linear Optics |
124
click to vote
CSL
2005
Springer
15 years 9 months ago
2005
Springer
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
114
Voted
MP
2008
15 years 3 months ago
2008
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
156
Voted
ECCV
2000
Springer
16 years 5 months ago
2000
Springer
A probabilistic method for tracking 3D articulated human figures in monocular image sequences is presented. Within a Bayesian framework, we define a generative model of image appea...
116
click to vote
AVSS
2006
IEEE
15 years 9 months ago
2006
IEEE
Although the use of super-resolution techniques has demonstrated the ability to improve face recognition accuracy when compared to traditional upsampling techniques, they are difï...
137
Voted
IAT
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we propose a novel approach to solving the distributed constraint optimisation problem (DCOP) that guarantees completeness, while having linear communication comple...