Sciweavers

5130 search results - page 1005 / 1026
» Constraint Query Languages
Sort
View
CIKM
1993
Springer
14 years 1 months ago
Collection Oriented Match
match algorithms that can efficiently handleAbstract complex tests in the presence of large amounts of data. Match algorithms that are capable of handling large amounts of On the o...
Anurag Acharya, Milind Tambe
CSL
2009
Springer
14 years 1 months ago
Fixed-Point Definability and Polynomial Time
My talk will be a survey of recent results about the quest for a logic capturing polynomial time. In a fundamental study of database query languages, Chandra and Harel [4] first ra...
Martin Grohe
CLEF
2006
Springer
14 years 1 months ago
CLEF-2006 CL-SR at Maryland: English and Czech
The University of Maryland participated in the English and Czech tasks. For English, one monolingual run using only fields based on fully automatic transcription (the required con...
Jianqiang Wang, Douglas W. Oard
CLEF
2006
Springer
14 years 1 months ago
University of Alicante at WiQA 2006
This paper presents the participation of University of Alicante at the WiQA pilot task organized as part of the CLEF 2006 campaign. For a given set of topics, this task presuppose...
Antonio Toral Ruiz, Georgiana Puscasu, Lorenza Mor...
ECAI
1998
Springer
14 years 1 months ago
Description Logics with Concrete Domains and Aggregation
Abstract. We extend different Description Logics by concrete domains (such as integers and reals) and by aggregation functions over these domains (such as min;max;count;sum), which...
Franz Baader, Ulrike Sattler
« Prev « First page 1005 / 1026 Last » Next »