916 search results - page 175 / 184 » Algorithm selection: a quantitative computation-intensive op... |
CORR
1999
Springer
13 years 7 months ago
1999
Springer
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
ICASSP
2008
IEEE
14 years 1 months ago
2008
IEEE
Finding sparse approximate solutions to large underdetermined linear systems of equations is a common problem in signal/image processing and statistics. Basis pursuit, the least a...
ATAL
2005
Springer
14 years 29 days ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...
PKDD
2010
Springer
13 years 5 months ago
2010
Springer
Abstract. One solution to the lack of label problem is to exploit transfer learning, whereby one acquires knowledge from source-domains to improve the learning performance in the t...
ESAS
2004
Springer
14 years 24 days ago
2004
Springer
The common perception of public key cryptography is that it is complex, slow and power hungry, and as such not at all suitable for use in ultra-low power environments like wireless...