2914 search results - page 361 / 583 » Optimization by Stochastic Continuation |
181
click to vote
ICML
2009
IEEE
16 years 7 months ago
2009
IEEE
Recent work has shown that one can learn the structure of Gaussian Graphical Models by imposing an L1 penalty on the precision matrix, and then using efficient convex optimization...
177
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
The majority of the existing algorithms for learning decision trees are greedy--a tree is induced top-down, making locally optimal decisions at each node. In most cases, however, ...
177
click to vote
KDD
2007
ACM
16 years 7 months ago
2007
ACM
Abstract. As more and more person-specific data like health information becomes available, increasing attention is paid to confidentiality and privacy protection. One proposed mode...
185
click to vote
ASPDAC
2009
ACM
16 years 1 months ago
2009
ACM
— Recent advances in statistical timing analysis (SSTA) achieve great success in computing arrival times under variations by extending sum and maximum operations to random variab...
170
click to vote
LICS
2007
IEEE
16 years 25 days ago
2007
IEEE
Markov decision processes (MDPs) are controllable discrete event systems with stochastic transitions. The payoff received by the controller can be evaluated in different ways, dep...