PRL
1998
13 years 4 months ago
1998
Surprisingly simple local learning algorithms are known to outperform many other global non-linear machines. Unfortunately, these algorithms are computationally costly. A means of...
DM
1999
13 years 4 months ago
1999
Maximal sets of s mutually orthogonal Latin squares of order v are constructed for in
DM
1999
13 years 4 months ago
1999
We prove that there are no n-agonal musquashes for n even with n = 6. This resolves a problem raised in Woodall's 1971 paper `Thrackles and Deadlock'. c 1999 Elsevier Sc...
DAM
1999
13 years 4 months ago
1999
Whereas Stanley, Proctor and others studied Sperner properties of the poset L(k; m) we consider shadows of left-compressed sets and derive asymptotic bounds on their sizes. ? 1999...
IPL
1998
13 years 4 months ago
1998
We propose a combination of Kleene’s three-valued logic and ACP process algebra via the guarded command construct. We present an operational semantics in SOS-style, and a comple...
IPL
2002
13 years 4 months ago
2002
In this paper, we study the existence of cycles of all lengths in the recursive circulant graphs, and we show a necessary and sufficient condition for the graph being pancyclic an...
FSS
2002
13 years 4 months ago
2002
We comment on the learning properties of the fuzzy backpropagation algorithm introduced in Stoeva and Nikov (Fuzzy Sets and Systems 112 (2000) 27). c 2001 Elsevier Science B.V. Al...
DM
2002
13 years 4 months ago
2002
The recently introduced chain and sheaf polynomials of a graph are shown to be essentially equivalent to a weighted version of the Tutte polynomial. c 2002 Elsevier Science B.V. A...
DM
2002
13 years 4 months ago
2002
Following a question of Anstee and Farber we investigate the possibility that all bridged graphs are cop-win. We show that in
DM
2000
13 years 4 months ago
2000
In this paper, we