2514 search results - page 333 / 503 » On the Computation of Approximations of Database Queries |
161
click to vote
AI
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. In this paper, we propose that the select operator in relational databases be adopted for incorporating evidence in Bayesian networks. This approach does not involve the ...
229
click to vote
DLOG
2011
2011
Reasoning in Resource-Constrained Environments: a Matchmaking Engine over Relational Knowledge Bases
14 years 10 months ago
We present a framework for logic-based matchmaking on ALN ABoxes stored in a relational database. The proposed approach allows both non-standard reasoning and subsumption check be ...
167
click to vote
COCO
2003
Springer
16 years 1 days ago
2003
Springer
We consider a fundamental problem in data structures, static predecessor searching: Given a subset S of size n from the universe [m], store S so that queries of the form “What i...
169
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
Content-based image retrievalsystems use low-levelfeatures like color and texturefor image representation. Given these representationsasfeature vectors, similarity between images ...
273
click to vote
SIGMOD
2008
ACM
16 years 7 months ago
2008
ACM
Current approaches to develop information extraction (IE) programs have largely focused on producing precise IE results. As such, they suffer from three major limitations. First, ...