Sciweavers

1265 search results - page 84 / 253
» Finding the Key to a Synapse
Sort
View
NCI
2004
132views Neural Networks» more  NCI 2004»
13 years 10 months ago
A comparison between spiking and differentiable recurrent neural networks on spoken digit recognition
In this paper we demonstrate that Long Short-Term Memory (LSTM) is a differentiable recurrent neural net (RNN) capable of robustly categorizing timewarped speech data. We measure ...
Alex Graves, Nicole Beringer, Jürgen Schmidhu...
NIPS
2004
13 years 10 months ago
Similarity and Discrimination in Classical Conditioning: A Latent Variable Account
We propose a probabilistic, generative account of configural learning phenomena in classical conditioning. Configural learning experiments probe how animals discriminate and gener...
Aaron C. Courville, Nathaniel D. Daw, David S. Tou...
PDPTA
2004
13 years 10 months ago
Evaluation of a Job Admission Algorithm for Bandwidth Constrained Grids
Abstract One of the goals envisioned by Grid computing is to make the execution of both computational and data-intensive problems possible. A key problem is finding the optimal set...
Marc De Leenheer, Pieter Thysebaert, Bruno Volckae...
SODA
2001
ACM
92views Algorithms» more  SODA 2001»
13 years 10 months ago
On universally easy classes for NP-complete problems
We explore the natural question of whether all NP-complete problems have a common restriction under which they are polynomially solvable. More precisely, we study what languages a...
Erik D. Demaine, Alejandro López-Ortiz, J. ...
SODA
2004
ACM
156views Algorithms» more  SODA 2004»
13 years 10 months ago
Approximating Minimum Max-Stretch spanning Trees on unweighted graphs
Given a graph G and a spanning tree T of G, we say that T is a tree t-spanner of G if the distance between every pair of vertices in T is at most t times their distance in G. The p...
Yuval Emek, David Peleg