387 search results - page 29 / 78 » Reasoning About Approximate Match Query Results |
PODS
2005
ACM
15 years 10 months ago
2005
ACM
MSO logic on unranked trees has been identified as a convenient theoretical framework for reasoning about expressiveness and implementations of practical XML query languages. As a...
SEMWEB
2009
Springer
15 years 4 months ago
2009
Springer
This paper suggests appropriate rules to set up ontology matching evaluations and for golden standard construction and use which can significantly improve the quality of the preci...
ICML
1995
IEEE
15 years 10 months ago
1995
IEEE
The success ofreinforcement learninginpractical problems depends on the ability to combine function approximation with temporal di erence methods such as value iteration. Experime...
VMCAI
2007
Springer
15 years 3 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
WWW
2010
ACM
15 years 4 months ago
2010
ACM
In this paper, we address the problem of database selection for XML document collections, that is, given a set of collections and a user query, how to rank the collections based o...