114 search results - page 9 / 23 » Some Notes on Pseudo-closed Sets |
CORR
2010
Springer
15 years 13 days ago
2010
Springer
In [Spi], we developed a category of databases in which the schema of a database is represented as a simplicial set. Each simplex corresponds to a table in the database. There, our...
DM
2008
15 years 13 days ago
2008
For a positive integer k and a graph G, the k-colour graph of G, Ck(G), is the graph that has the proper k-vertex-colourings of G as its vertex set, and two k-colourings are joine...
IPL
2000
15 years 4 days ago
2000
Visual cryptography is a cryptographic paradigm introduced by Naor and Shamir [Lecture Notes in Comput. Sci., Vol. 950, Springer, Berlin, 1995, p. 1]. Some predefined set of parti...
AAAI
2008
15 years 2 months ago
2008
A recalcitrant problem in approaches to iterated belief revision is that, after first revising by a formula and then by a formula that is inconsistent with the first formula, all ...
177
Voted
ICDE
2012
IEEE
13 years 2 months ago
2012
IEEE
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...