2218 search results - page 234 / 444 » Testing Expressibility Is Hard |
178
click to vote
VLDB
2007
ACM
16 years 3 months ago
2007
ACM
This demonstration showcases the STEP system for natural language access to relational databases. In STEP an administrator authors a highly structured semantic grammar through cou...
149
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
In this paper, we introduce a new approach for partial 3D face recognition, which makes use of shape decomposition over the rigid1 part of a face. To explore the descriptiveness o...
111
click to vote
TACAS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. In this paper we prove that the transitive closure of a nondeterministic octagonal relation using integer counters can be expressed in Presburger arithmetic. The direct c...
108
click to vote
IAT
2009
IEEE
15 years 10 months ago
2009
IEEE
— Opinion mining is the task of extracting from a set of documents opinions expressed by a source on a specified target. This article presents a comparative study on the methods ...
121
click to vote
IEEESCC
2009
IEEE
15 years 10 months ago
2009
IEEE
—The easiest way for a user to express his needs regarding a desired service is to use natural language. The main issues come from the fact that the natural language is incomplet...