8582 search results - page 214 / 1717 » Here or There |
157
click to vote
CPC
1998
15 years 6 months ago
1998
Deuber’s Theorem says that, given any m, p, c, r in N, there exist n, q, µ in N such that whenever an (n, q, cµ )-set is r-coloured, there is a monochrome (m, p, c)-set. This t...
158
click to vote
ET
1998
15 years 6 months ago
1998
This paper extends the design method of self-testing checkers (STCs) for some m-out-of-n (m/n) codes, proposed recently in IEEE Trans. Comput., 1995 by Dimakopoulos et al. The chec...
121
click to vote
IJAR
1998
15 years 6 months ago
1998
Decision-making procedure based on fuzzy relational composition may require that the involved connectives are not idempotent to handle signi cant information properly. Yet, non-id...
159
click to vote
JCAL
2002
15 years 6 months ago
2002
As computing technology has increasingly become relevant to people's everyday lives, emphasis is being placed on ensuring Computer Assisted Learning (CAL) tools support users ...
160
click to vote
COMBINATORICS
1999
15 years 6 months ago
1999
Kasteleyn stated that the generating function of the perfect matchings of a graph of genus g may be written as a linear combination of 4g Pfaffians. Here we prove this statement. ...