Sciweavers

1154 search results - page 122 / 231
» Mathematizing C concurrency
Sort
View
TCS
2008
13 years 9 months ago
Modeling spiking neural networks
A notation for the functional specification of a wide range of neural networks consisting of temporal or non-temporal neurons, is proposed. The notation is primarily a mathematica...
Ioannis D. Zaharakis, Achilles D. Kameas
COMBINATORICS
2000
114views more  COMBINATORICS 2000»
13 years 9 months ago
Restricted Permutations, Continued Fractions, and Chebyshev Polynomials
Let fr n(k) be the number of 132-avoiding permutations on n letters that contain exactly r occurrences of 12 . . . k, and let Fr(x; k) and F (x, y; k) be the generating functions d...
Toufik Mansour, Alek Vainshtein
ORDER
2000
85views more  ORDER 2000»
13 years 9 months ago
Epimorphisms in Certain Varieties of Algebras
We prove a lemma which, under restrictive conditions, shows that epimorphisms in V are surjective if this is true for epimorphisms from irreducible members of V . This lemma is app...
Gunter Bruns, John Harding
FUIN
1998
135views more  FUIN 1998»
13 years 9 months ago
A Study on Partitioned Iterative Function Systems for Image Compression
The technique of image compression using Iterative Function System (IFS) is known as fractal image compression. An extension of IFS theory is called as Partitioned or local Iterati...
Suman K. Mitra, C. A. Murthy, Malay Kumar Kundu
COMBINATORICS
1999
75views more  COMBINATORICS 1999»
13 years 9 months ago
On the Stanley-Wilf Conjecture for the Number of Permutations Avoiding a Given Pattern
Abstract. Consider, for a permutation Sk, the number F(n, ) of permutations in Sn which avoid as a subpattern. The conjecture of Stanley and Wilf is that for every there is a c...
Richard Arratia