2512 search results - page 161 / 503 » Learning from Highly Structured Data by Decomposition |
80
Voted
ESANN
2003
14 years 11 months ago
2003
We derive continuous-time batch and online versions of the recently introduced efficient O(N2 ) training algorithm of Atiya and Parlos [2000] for fully recurrent networks. A mathem...
105
click to vote
ICML
2007
IEEE
15 years 11 months ago
2007
IEEE
Supervised learning is difficult with high dimensional input spaces and very small training sets, but accurate classification may be possible if the data lie on a low-dimensional ...
82
Voted
ICANN
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Modeling the statistical structure of natural images is interesting for reasons related to neuroscience as well as engineering. Currently, this modeling relies heavily on...
191
Voted
ICDE
2000
IEEE
15 years 11 months ago
2000
IEEE
In high-dimensional and complex metric spaces, determining the nearest neighbor (NN) of a query object ? can be a very expensive task, because of the poor partitioning operated by...
103
Voted
PADS
2006
ACM
15 years 4 months ago
2006
ACM
A master/worker paradigm for executing large-scale parallel discrete event simulation programs over networkenabled computational resources is proposed and evaluated. In contrast t...