146 search results - page 2 / 30 » Computably Enumerable Sets and Quasi-Reducibility |
BSL
2000
13 years 8 months ago
2000
FIMI
2003
13 years 10 months ago
2003
We describe an implementation of an algorithm for enumerating all maximal frequent sets using irredundant dualization, which is an improved version of that of Gunopulos et al. The...
TCS
2002
13 years 8 months ago
2002
We study the relationship between a computably enumerable real and its presentations: ways of approximating the real by enumerating a prefix-free set of binary strings.
DCC
2005
IEEE
14 years 8 months ago
2005
IEEE
In this paper various methods for computing the support weight enumerators of binary, linear, even, isodual codes are described. It is shown that there exist relationships between...
COMMA
2006
13 years 10 months ago
2006
The hitherto most abstract, and hence general, argumentation system, is the one described by Dung in a paper from 1995. This framework does not allow for joint attacks on arguments...