163 search results - page 10 / 33 » Effective categoricity of equivalence structures |
MLQ
2002
13 years 7 months ago
2002
Abstract. In this paper I compare two well studied approaches to topological semantics-the domain-theoretic approach, exemplified by the category of countably based equilogical spa...
KBS
2008
13 years 6 months ago
2008
Feature subset selection presents a common challenge for the applications where data with tens or hundreds of features are available. Existing feature selection algorithms are mai...
BIRTHDAY
2000
Springer
13 years 11 months ago
2000
Springer
Bistructures are a generalisation of event structures which allow a representation of spaces of functions at higher types in an orderextensional setting. The partial order of caus...
ICDE
2003
IEEE
14 years 8 months ago
2003
IEEE
Analyzing sequence data has become increasingly important recently in the area of biological sequences, text documents, web access logs, etc. In this paper, we investigate the pro...
CSC
2008
13 years 9 months ago
2008
- The set-covering problem is an interesting problem in computational complexity theory. In [1], the setcovering problem has been proved to be NP hard and a greedy heuristic algori...