Sciweavers

251 search results - page 16 / 51
» Approximation and Estimation Bounds for Artificial Neural Ne...
Sort
View
IJON
2007
98views more  IJON 2007»
13 years 7 months ago
Convergent design of piecewise linear neural networks
Piecewise linear networks (PLNs) are attractive because they can be trained quickly and provide good performance in many nonlinear approximation problems. Most existing design alg...
Hema Chandrasekaran, Jiang Li, W. H. Delashmit, Pr...
CP
2008
Springer
13 years 9 months ago
Approximate Solution Sampling (and Counting) on AND/OR Spaces
In this paper, we describe a new algorithm for sampling solutions from a uniform distribution over the solutions of a constraint network. Our new algorithm improves upon the Sampli...
Vibhav Gogate, Rina Dechter
NN
2002
Springer
136views Neural Networks» more  NN 2002»
13 years 7 months ago
Bayesian model search for mixture models based on optimizing variational bounds
When learning a mixture model, we suffer from the local optima and model structure determination problems. In this paper, we present a method for simultaneously solving these prob...
Naonori Ueda, Zoubin Ghahramani
STOC
2005
ACM
167views Algorithms» more  STOC 2005»
14 years 7 months ago
Approximately counting integral flows and cell-bounded contingency tables
We consider the problem of approximately counting integral flows in a network. We show that there is an fpras based on volume estimation if all capacities are sufficiently large, ...
Mary Cryan, Martin E. Dyer, Dana Randall
ATAL
2009
Springer
14 years 2 months ago
Directed soft arc consistency in pseudo trees
We propose an efficient method that applies directed soft arc consistency to a Distributed Constraint Optimization Problem (DCOP) which is a fundamental framework of multi-agent ...
Toshihiro Matsui, Marius-Calin Silaghi, Katsutoshi...