2218 search results - page 269 / 444 » Testing Expressibility Is Hard |
112
click to vote
TSD
2010
Springer
14 years 10 months ago
2010
Springer
This paper presents a quantitative performance analysis of two different approaches to the lemmatization of the Czech text data. The first one is based on manually prepared diction...
136
Voted
DLOG
2009
14 years 10 months ago
2009
Abstract. TBox reasoning in description logics is hard. For example, reasoning in SROIQ (i.e. OWL2-DL) is N2EXPTIME-complete; even with R, a fragment of SROIQ supporting ALC GCIs a...
122
click to vote
DMIN
2009
14 years 10 months ago
2009
When performing concept description, models need to be evaluated both on accuracy and comprehensibility. A comprehensible concept description model should present the most importan...
128
Voted
ECRTS
2009
IEEE
14 years 10 months ago
2009
IEEE
While hardware caches are generally effective at improving application performance, they greatly complicate performance prediction. Slight changes in memory layout or data access p...
106
Voted
ACCV
2010
Springer
14 years 7 months ago
2010
Springer
The state of the art for large database object retrieval in images is based on quantizing descriptors of interest points into visual words. High similarity between matching image r...