Sciweavers

1404 search results - page 113 / 281
» Complexity of admissible rules
Sort
View
ACTA
2007
114views more  ACTA 2007»
13 years 9 months ago
Recursive descent parsing for Boolean grammars
The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the f...
Alexander Okhotin
ACTA
2004
87views more  ACTA 2004»
13 years 9 months ago
P systems with symport/antiport simulating counter automata
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...
Pierluigi Frisco, Hendrik Jan Hoogeboom
IJON
2002
130views more  IJON 2002»
13 years 8 months ago
Error-backpropagation in temporally encoded networks of spiking neurons
For a network of spiking neurons that encodes information in the timing of individual spike times, we derive a supervised learning rule, SpikeProp, akin to traditional errorbackpr...
Sander M. Bohte, Joost N. Kok, Johannes A. La Pout...
ICIP
2005
IEEE
14 years 10 months ago
A dynamic Bezier curve model
Bezier curves (BC) are fundamental to a wide range of applications from computer-aided design through to object shape descriptions and surface mapping. Since BC only consider glob...
Ferdous Ahmed Sohel, Laurence S. Dooley, Gour C. K...
EMSOFT
2009
Springer
14 years 3 months ago
Cache-aware scheduling and analysis for multicores
The major obstacle to use multicores for real-time applications is that we may not predict and provide any guarantee on real-time properties of embedded software on such platforms...
Nan Guan, Martin Stigge, Wang Yi, Ge Yu