387 search results - page 45 / 78 » Reasoning About Approximate Match Query Results |
SSDBM
2008
IEEE
14 years 3 months ago
2008
IEEE
We propose an automatic method for modeling a relational database that uses SQL triggers and foreign-keys to efficiently answer positive semantic queries about ground instances for...
SDM
2010
SIAM
13 years 10 months ago
2010
SIAM
Large graph databases are commonly collected and analyzed in numerous domains. For reasons related to either space efficiency or for privacy protection (e.g., in the case of socia...
DATESO
2007
13 years 10 months ago
2007
When searching databases of nucleotide or protein sequences, finding a local alignment of two sequences is one of the main tasks. Since the sizes of available databases grow const...
ATAL
2008
Springer
13 years 10 months ago
2008
Springer
The ability for an agent to reason under uncertainty is crucial for many planning applications, since an agent rarely has access to complete, error-free information about its envi...
COR
2008
13 years 8 months ago
2008
This paper is concerned with procedures for ranking discrete alternatives when their values are evaluated precisely on multiple attributes and the attribute weights are known only...