1523 search results - page 174 / 305 » The Computational Complexity of Linear Optics |
147
click to vote
CVPR
2007
IEEE
16 years 6 months ago
2007
IEEE
Dimensionality reduction is an important issue when facing high-dimensional data. For supervised dimensionality reduction, Linear Discriminant Analysis (LDA) is one of the most po...
142
Voted
ECCV
2008
Springer
16 years 5 months ago
2008
Springer
We present a new Gaussian Process inference algorithm, called Online Sparse Matrix Gaussian Processes (OSMGP), and demonstrate its merits with a few vision applications. The OSMGP ...
141
click to vote
ICIP
2005
IEEE
16 years 5 months ago
2005
IEEE
Robustly tracking moving objects in video sequences is one of the key problems in computer vision. In this paper we introduce a computationally efficient nonlinear kernel learning...
144
Voted
DAC
2002
ACM
16 years 4 months ago
2002
ACM
The ability to compute the parasitic inductance of the interconnect is critical to the timing verification of modern VLSI circuits. A challenging aspect of inductance extraction i...
118
Voted
SIGECOM
2009
ACM
15 years 10 months ago
2009
ACM
Policy teaching considers a Markov Decision Process setting in which an interested party aims to influence an agent’s decisions by providing limited incentives. In this paper, ...