Sciweavers

1106 search results - page 172 / 222
» On regularization algorithms in learning theory
Sort
View
TEC
2008
139views more  TEC 2008»
15 years 4 months ago
Genetic Programming Approaches for Solving Elliptic Partial Differential Equations
In this paper, we propose a technique based on genetic programming (GP) for meshfree solution of elliptic partial differential equations. We employ the least-squares collocation pr...
Andras Sobester, Prasanth B. Nair, Andy J. Keane
141
Voted
NN
2010
Springer
125views Neural Networks» more  NN 2010»
15 years 2 months ago
Parameter-exploring policy gradients
We present a model-free reinforcement learning method for partially observable Markov decision problems. Our method estimates a likelihood gradient by sampling directly in paramet...
Frank Sehnke, Christian Osendorfer, Thomas Rü...
PAMI
2010
337views more  PAMI 2010»
15 years 2 months ago
Single-Image Super-Resolution Using Sparse Regression and Natural Image Prior
—This paper proposes a framework for single-image super-resolution. The underlying idea is to learn a map from input low-resolution images to target high-resolution images based ...
Kwang In Kim, Younghee Kwon
IC3
2009
15 years 2 months ago
A New Approach towards Bibliographic Reference Identification, Parsing and Inline Citation Matching
A number of algorithms and approaches have been proposed towards the problem of scanning and digitizing research papers. We can classify work done in the past into three major appr...
Deepank Gupta, Bob Morris, Terry Catapano, Guido S...
RECOMB
2003
Springer
16 years 4 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson