Sciweavers

2218 search results - page 234 / 444
» Testing Expressibility Is Hard
Sort
View
155
Voted
VLDB
2007
ACM
136views Database» more  VLDB 2007»
16 years 28 days ago
A STEP Towards Realizing Codd's Vision of Rendezvous with the Casual User
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...
Michael Minock
133
Voted
ICPR
2010
IEEE
15 years 7 months ago
Partial Face Biometry Using Shape Decomposition on 2D Conformal Maps of Faces
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...
Przemyslaw Szeptycki, Mohsen Ardabilian, Liming Ch...
TACAS
2009
Springer
115views Algorithms» more  TACAS 2009»
15 years 7 months ago
Iterating Octagons
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...
Marius Bozga, Codruta Gîrlea, Radu Iosif
84
Voted
IAT
2009
IEEE
15 years 7 months ago
Opinion Mining on Newspaper Quotations
— 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 ...
Alexandra Balahur, Ralf Steinberger, Erik Van der ...
103
Voted
IEEESCC
2009
IEEE
15 years 7 months ago
Service Composition Based on Natural Language Requests
—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...
Marcel Cremene, Jean-Yves Tigli, Stephane Lavirott...