3875 search results - page 366 / 775 » Approximation algorithms for the 0-extension problem |
161
click to vote
ICAI
2007
15 years 8 months ago
2007
Abstract— The paper proposes a dynamic programming algorithm for training of functional networks. The algorithm considers each node as a state. The problem is formulated as find...
168
click to vote
MICCAI
1999
Springer
15 years 11 months ago
1999
Springer
The “Demons Algorithm” in increasingly used for non-rigid registration of 3D medical images. However, if it is fast and usually accurate, the algorithm is based on intuitive id...
174
click to vote
SIGGRAPH
1998
ACM
15 years 11 months ago
1998
ACM
We describe our experience with a new algorithm for the reconstruction of surfaces from unorganized sample points in IR 3. The algorithm is the first for this problem with provab...
142
click to vote
ESANN
2000
15 years 8 months ago
2000
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
208
click to vote
UAI
1998
15 years 8 months ago
1998
In recent years there has been a flurry of works on learning Bayesian networks from data. One of the hard problems in this area is how to effectively learn the structure of a beli...