4277 search results - page 456 / 856 » On Multiple Linear Approximations |
137
click to vote
IGARSS
2009
15 years 1 months ago
2009
Finding an accurate sparse approximation of a spectral vector described by a linear model, when there is available a library of possible constituent signals (called endmembers or ...
154
click to vote
CVPR
2011
IEEE
15 years 16 days ago
2011
IEEE
We present a novel theory for characterizing defocus blurs in multi-perspective cameras such as catadioptric mirrors. Our approach studies how multi-perspective ray geometry trans...
162
click to vote
ALGORITHMICA
2011
14 years 11 months ago
2011
We show that computing the crossing number and the odd crossing number of a graph with a given rotation system is NP-complete. As a consequence we can show that many of the well-k...
129
click to vote
CORR
2011
Springer
14 years 11 months ago
2011
Springer
—In this work, we study the effects of finite buffers on the throughput and delay of line networks with erasure links. We identify the calculation of performance parameters such...
144
click to vote
JMLR
2010
14 years 11 months ago
2010
Round-based games are an instance of discrete planning problems. Some of the best contemporary game tree search algorithms use random roll-outs as data. Relying on a good policy, ...