3874 search results - page 337 / 775 » Approximation Algorithms for k-hurdle Problems |
128
Voted
MICCAI
1999
Springer
15 years 9 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...
143
Voted
SIGGRAPH
1998
ACM
15 years 9 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...
120
click to vote
ESANN
2000
15 years 6 months ago
2000
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
182
click to vote
UAI
1998
15 years 6 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...
140
Voted
CIAC
2010
Springer
15 years 8 months ago
2010
Springer
A flow on a directed network is said to be confluent if the flow uses at most one outgoing arc at each node. Confluent flows arise naturally from destination-based routing. We stud...