This HTML5 document contains 45 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
n16http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n13http://purl.org/net/nknouf/ns/bibtex#
n14http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n12http://linked.opendata.cz/ontology/domain/vavai/
n17http://linked.opendata.cz/resource/domain/vavai/zamer/
n5https://schema.org/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n9http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F67985807%3A_____%2F03%3A06030045%21RIV%2F2004%2FMSM%2FA06004%2FN/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n19http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n15http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F67985807%3A_____%2F03%3A06030045%21RIV%2F2004%2FMSM%2FA06004%2FN
rdf:type
skos:Concept n12:Vysledek
dcterms:description
We consider a single perceptron N with synaptic delays which generalizes a simplified model for a spiking neuron where not only the time that a pulse needs to travel through a synapse is taken into account but also the input firing rates may have more different levels. A synchronization technique is introduced so that the results concerning the learnability of spiking neurons with binary delays also apply to N with arbitrary delays. In particular, the consistency problem for N with programmable delays and.. We consider a single perceptron N with synaptic delays which generalizes a simplified model for a spiking neuron where not only the time that a pulse needs to travel through a synapse is taken into account but also the input firing rates may have more different levels. A synchronization technique is introduced so that the results concerning the learnability of spiking neurons with binary delays also apply to N with arbitrary delays. In particular, the consistency problem for N with programmable delays and..
dcterms:title
On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays. On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays.
skos:prefLabel
On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays. On the Complexity of Training a Single Perceptron with Programmable Synaptic Delays.
skos:notation
RIV/67985807:_____/03:06030045!RIV/2004/MSM/A06004/N
n3:strany
221;233
n3:aktivita
n4:P n4:Z
n3:aktivity
P(LN00A056), Z(AV0Z1030915)
n3:dodaniDat
n15:2004
n3:domaciTvurceVysledku
n14:3031314
n3:druhVysledku
n19:D
n3:duvernostUdaju
n11:S
n3:entitaPredkladatele
n9:predkladatel
n3:idSjednocenehoVysledku
619434
n3:idVysledku
RIV/67985807:_____/03:06030045
n3:jazykVysledku
n18:eng
n3:klicovaSlova
spiking neuron; synaptic delays; loading problem; PAC learning; robust learning
n3:klicoveSlovo
n6:robust%20learning n6:spiking%20neuron n6:PAC%20learning n6:loading%20problem n6:synaptic%20delays
n3:kontrolniKodProRIV
[5FDD2C036E71]
n3:mistoKonaniAkce
Sapporo [JP]
n3:mistoVydani
Berlin
n3:nazevZdroje
Algorithmic Learning Theory.
n3:obor
n20:BA
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:pocetUcastnikuAkce
0
n3:pocetZahranicnichUcastnikuAkce
0
n3:projekt
n7:LN00A056
n3:rokUplatneniVysledku
n15:2003
n3:tvurceVysledku
Šíma, Jiří
n3:typAkce
n16:WRD
n3:zahajeniAkce
2003-10-17+02:00
n3:zamer
n17:AV0Z1030915
s:numberOfPages
13
n13:hasPublisher
Springer-Verlag
n5:isbn
3-540-20291-9