1464 search results - page 202 / 293 » On optimal anonymization for l -diversity |
222
click to vote
GECCO
2009
Springer
15 years 4 months ago
2009
Springer
We provide an overview of using genetic programming (GP) to model stock returns. Our models employ GP terminals (model decision variables) that are financial factors identified by...
166
click to vote
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
Dramatic progress has been made in algorithms for placement and routing over the last 5 years, with improvements in both speed and quality. Combining placement and routing into a ...
203
click to vote
SIAMCO
2011
15 years 1 months ago
2011
We consider Bayesian information collection, in which a measurement policy collects information to support a future decision. This framework includes ranking and selection, continu...
168
click to vote
INTERSPEECH
2010
15 years 1 months ago
2010
Recently, Deep Belief Networks (DBNs) have been proposed for phone recognition and were found to achieve highly competitive performance. In the original DBNs, only framelevel info...
200
click to vote
SIAMIS
2010
15 years 1 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...