1835 search results - page 253 / 367 » Classifying Description Logics |
158
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
165
click to vote
INTERSPEECH
2010
14 years 11 months ago
2010
Practical supervised learning scenarios involving subjectively evaluated data have multiple evaluators, each giving their noisy version of the hidden ground truth. Majority logic ...
135
click to vote
ICDAR
2011
IEEE
14 years 3 months ago
2011
IEEE
– Better understanding the document logical components is crucial to many applications, e.g., document classification or data integration. As the development of digital libraries...
122
click to vote
JOLLI
2008
15 years 4 months ago
2008
Saul Kripke's thesis that ordinary proper names are rigid designators is supported by widely shared intuitions about the occurrence of names in ordinary modal contexts. By th...
124
click to vote
HICSS
1997
IEEE
15 years 8 months ago
1997
IEEE
The discipline of narratology has long recognized the need to classify documents as instances of different text types. We have discovered that classification is as applicable to h...