71228 search results - page 439 / 14246 » Algorithms |
191
click to vote
SODA
2004
ACM
15 years 9 months ago
2004
ACM
We describe a machine model for automatically dynamizing static algorithms and apply it to historyindependent data structures. Static programs expressed in this model are dynamize...
190
click to vote
BMVC
1998
15 years 9 months ago
1998
Evaluating the performance of optical flow algorithms has been difficult because of the lack of ground-truth data sets for complex scenes. We describe a simple modification to a r...
160
click to vote
ESANN
2000
15 years 9 months ago
2000
: Recurrent neural networks possess interesting universal approximation capabilities, making them good candidates for time series modeling. Unfortunately, long term dependencies ar...
197
click to vote
NIPS
2000
15 years 9 months ago
2000
Non-negative matrix factorization (NMF) has previously been shown to be a useful decomposition for multivariate data. Two different multiplicative algorithms for NMF are analyzed....
240
click to vote
UAI
1998
15 years 9 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...