1957 search results - page 251 / 392 » Approximate algorithms for neural-Bayesian approaches |
ICML
2010
IEEE
14 years 11 months ago
2010
IEEE
This paper formalizes Feature Selection as a Reinforcement Learning problem, leading to a provably optimal though intractable selection policy. As a second contribution, this pape...
SIGMOD
2010
ACM
14 years 10 months ago
2010
ACM
Many websites provide restrictive form-like interfaces which allow users to execute search queries on the underlying hidden databases. In this paper, we consider the problem of es...
107
click to vote
HICSS
2008
IEEE
14 years 10 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...
120
click to vote
AMAI
2008
Springer
14 years 10 months ago
2008
Springer
This paper presents and evaluates an approach to Bayesian model averaging where the models are Bayesian nets (BNs). Prior distributions are defined using stochastic logic programs...
112
click to vote
ENTCS
2006
14 years 10 months ago
2006
It is a well-known fact that algorithms are often hidden inside mathematical proofs. If these proofs are formalized inside a proof assistant, then a mechanism called extraction ca...