603 search results - page 54 / 121 » A General Approximation Technique for Constrained Forest Pro... |
ATAL
2008
Springer
15 years 3 months ago
2008
Springer
In this paper, we show how adaptive prototype optimization can be used to improve the performance of function approximation based on Kanerva Coding when solving largescale instanc...
KDD
2010
ACM
15 years 3 months ago
2010
ACM
The fused Lasso penalty enforces sparsity in both the coefficients and their successive differences, which is desirable for applications with features ordered in some meaningful w...
123
Voted
SIGMOD
2010
ACM
15 years 6 months ago
2010
ACM
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
140
click to vote
CORR
2011
Springer
14 years 8 months ago
2011
Springer
Modeling the behavior of imperfect agents from a small number of observations is a difficult, but important task. In the singleagent decision-theoretic setting, inverse optimal co...
111
click to vote
KDD
2000
ACM
15 years 5 months ago
2000
ACM
Information extraction is one of the most important techniques used in Text Mining. One of the main problems in building information extraction (IE) systems is that the knowledge ...