2887 search results - page 148 / 578 » Name Generation and Linearity |
176
click to vote
CCO
2001
Springer
15 years 11 months ago
2001
Springer
Lagrangian relaxation is commonly used in combinatorial optimization to generate lower bounds for a minimization problem. We propose a modified Lagrangian relaxation which used i...
141
click to vote
NIPS
2004
15 years 7 months ago
2004
In this paper we present a framework for using multi-layer perceptron (MLP) networks in nonlinear generative models trained by variational Bayesian learning. The nonlinearity is h...
147
click to vote
COMBINATORICS
2007
15 years 6 months ago
2007
We show that the generating function (in n) for the number of walks on the square lattice with steps (1, 1), (1, −1), (2, 2) and (2, −2) from (0, 0) to (2n, 0) in the region 0...
158
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Smoothly bent paper-like surfaces are developable. They are however difficult to minimally parameterize since the number of meaningful parameters is intrinsically dependent on the...
197
click to vote
FOSSACS
2007
Springer
16 years 19 days ago
2007
Springer
Abstract. We introduce an extension of Hoare logic for call-by-value higherorder functions with ML-like local reference generation. Local references may be generated dynamically an...