Sciweavers

160 search results - page 11 / 32
» A Very Fast Learning Method for Neural Networks Based on Sen...
Sort
View
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
13 years 8 months ago
Towards memoryless model building
Probabilistic model building methods can render difficult problems feasible by identifying and exploiting dependencies. They build a probabilistic model from the statistical prope...
David Iclanzan, Dumitru Dumitrescu
CASES
2006
ACM
14 years 1 months ago
Automatic performance model construction for the fast software exploration of new hardware designs
Developing an optimizing compiler for a newly proposed architecture is extremely difficult when there is only a simulator of the machine available. Designing such a compiler requ...
John Cavazos, Christophe Dubach, Felix V. Agakov, ...
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 2 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
ESANN
2006
13 years 9 months ago
Magnification control for batch neural gas
Neural gas (NG) constitutes a very robust clustering algorithm which can be derived as stochastic gradient descent from a cost function closely connected to the quantization error...
Barbara Hammer, Alexander Hasenfuss, Thomas Villma...
NN
2008
Springer
150views Neural Networks» more  NN 2008»
13 years 7 months ago
Neural network based pattern matching and spike detection tools and services - in the CARMEN neuroinformatics project
In the study of information flow in the nervous system, component processes can be investigated using a range of electrophysiological and imaging techniques. Although data is diff...
Martyn Fletcher, Bojian Liang, Leslie Smith, Alast...