1523 search results - page 203 / 305 » The Computational Complexity of Linear Optics |
143
click to vote
SIGGRAPH
1998
ACM
15 years 8 months ago
1998
ACM
In this paper we present a set of efficient image based rendering methods capable of rendering multiple frames per second on a PC. The first method warps Sprites with Depth repr...
127
click to vote
ISCAS
1994
IEEE
15 years 8 months ago
1994
IEEE
Earlier research has shown that the problem of optimal weighted median filtering with structural constraints can be formulated as a nonconvex nonlinear programming problem in gene...
142
click to vote
ECAI
2006
Springer
15 years 7 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
135
click to vote
SIGGRAPH
2000
ACM
15 years 7 months ago
2000
ACM
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
130
click to vote
ICASSP
2010
IEEE
15 years 4 months ago
2010
IEEE
Polytope Faces Pursuit is a greedy algorithm that performs Basis Pursuit with similar order complexity to Orthogonal Matching Pursuit. The algorithm adds one basis vector at a tim...