Sciweavers

276 search results - page 54 / 56
» Querying Temporal Databases Using Controlled Natural Languag...
Sort
View
CIKM
1993
Springer
13 years 10 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
AOSD
2007
ACM
13 years 9 months ago
Performance improvement for persistent systems by AOP
Efficient data retrieval from databases is a significant issue of the design of persistent systems. We propose an aspect oriented persistent system named AspectualStore. Aspectual...
Yasuhiro Aoki, Shigeru Chiba
CSL
2009
Springer
13 years 9 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
DLOG
2003
13 years 7 months ago
Conceptual Modeling with Description Logics
The purpose of the chapter is to help someone familiar with DLs to understand the issues involved in developing an ontology for some universe of discourse, which is to become a co...
Alexander Borgida, Ronald J. Brachman
IJCAI
2003
13 years 7 months ago
Bayesian Information Extraction Network
Dynamic Bayesian networks (DBNs) offer an elegant way to integrate various aspects of language in one model. Many existing algorithms developed for learning and inference in DBNs ...
Leonid Peshkin, Avi Pfeffer