2356 search results - page 164 / 472 » Characterizations of postman sets |
173
click to vote
AI
2006
Springer
15 years 10 months ago
2006
Springer
This paper studies the problem of classification by using a concept lattice as a search space of classification rules. The left hand side of a classification rule is composed by a ...
193
click to vote
BIRTHDAY
2004
Springer
15 years 10 months ago
2004
Springer
A quantified Boolean formula is true, if for any existentially quantified variable there exists a Boolean function depending on the preceding universal variables, such that substi...
165
click to vote
EDBTW
2006
Springer
15 years 10 months ago
2006
Springer
For several reasons a database may not satisfy a given set of integrity constraints (ICs), but most likely most of the information in it is still consistent with those ICs; and cou...
185
click to vote
ERCIMDL
2006
Springer
15 years 10 months ago
2006
Springer
Digital libraries have untapped potential for supporting language teaching and learning. Although the Internet at large is widely used for language education, it has critical disad...
190
click to vote
MFDBS
1991
15 years 10 months ago
1991
We study an approach to relational databases which treats relations not as subsets of a Cartesian product but as subsets of some domain { a partially ordered space of descriptions...