129 search results - page 22 / 26 » Lower Bounds of Computational Power of a Synaptic Calculus |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
The paper investigates the power of the dynamic complexity classes DynFO, DynQF and DynPROP over string languages. The latter two classes contain problems that can be maintained us...
LATA
2011
Springer
12 years 10 months ago
2011
Springer
In this paper we propose a hierarchy of classes of languages, generated by networks of evolutionary processors with the filters in several special classes of regular sets. More p...
AFL
2011
12 years 7 months ago
2011
In this paper, we propose a new variant of Accepting Networks of Evolutionary Processors, in which the operations can be applied only arbitrarily to the words, while the filters ...
VLDB
2004
ACM
14 years 24 days ago
2004
ACM
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms. They are metric distance functions but cannot supp...
TON
2008
13 years 7 months ago
2008
-- Internet routers and Ethernet switches contain packet buffers to hold packets during times of congestion. Packet buffers are at the heart of every packet switch and router, whic...