11160 search results - page 383 / 2232 » Incompleteness in a General Setting |
151
click to vote
DATE
2005
IEEE
16 years 14 days ago
2005
IEEE
We provide a general formulation for the code-based test compression problem with fixed-length input blocks and propose a solution approach based on Evolutionary Algorithms. In c...
184
click to vote
SIBGRAPI
2005
IEEE
16 years 12 days ago
2005
IEEE
Mathematical morphology was originally conceived as a set theoretic approach for the processing of binary images. Approaches that extend classical binary morphology to gray-scale ...
169
click to vote
WWW
2010
ACM
16 years 4 days ago
2010
ACM
This paper studies the compressibility of RDF data sets. We show that big RDF data sets are highly compressible due to the structure of RDF graphs (power law), organization of URI...
167
click to vote
ECOOP
2003
Springer
16 years 1 days ago
2003
Springer
This paper explains how higher-order hierarchies can be used to handle the expression problem. The expression is concerned with extending both the set of data structures and the s...
159
click to vote
SAC
1994
ACM
15 years 11 months ago
1994
ACM
In this paper, the interest of fuzzy sets and possibility theory in the context of databases is presented. It is shown that these " notions provide an homogeneous framework f...