6251 search results - page 169 / 1251 » Randomness, Computability, and Density |
117
Voted
ESANN
2007
15 years 5 months ago
2007
Training recurrent neural networks is hard. Recently it has however been discovered that it is possible to just construct a random recurrent topology, and only train a single linea...
134
Voted
ICIP
1998
IEEE
16 years 5 months ago
1998
IEEE
Maximum a posteriori (MAP) filtering using the HuberMarkov random field (HMRF) image model has been shown in the past to be an effective method of reducing compression artifacts i...
108
click to vote
ICIP
2006
IEEE
15 years 10 months ago
2006
IEEE
We propose in this paper a new formulation of the equation of the optical flow enabling to compute global and local motions of multi-structure objects (flowers and petals, trees...
148
Voted
WDAG
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. The distributed complexity of computing a maximal independent set in a graph is of both practical and theoretical importance. While there exists an elegant O(log n) time ...
128
click to vote
ESANN
2008
15 years 5 months ago
2008
Reservoir Computing is a new paradigm for using Recurrent Neural Networks which shows promising results. However, as the recurrent part is created randomly, it typically needs to b...