Sciweavers

1529 search results - page 67 / 306
» Querying for meta knowledge
Sort
View
IJCAI
1993
15 years 7 months ago
The Complexity of Nested Counterfactuals and Iterated Knowledge Base Revisions
We consider the computational complexity of evaluating nested counterfactuals over a propositional knowledge base. Counterfactual implication models a statement "if p, then q...
Thomas Eiter, Georg Gottlob
ICDE
2009
IEEE
129views Database» more  ICDE 2009»
16 years 8 months ago
Evaluating TOP-K Queries over Business Processes
A Business Process (BP) consists of some business activities undertaken by one or more organizations in pursuit of some business goal. Tools for querying and analyzing BP specifica...
Daniel Deutch, Tova Milo
SIGMOD
2004
ACM
184views Database» more  SIGMOD 2004»
16 years 6 months ago
Identifying Similarities, Periodicities and Bursts for Online Search Queries
We present several methods for mining knowledge from the query logs of the MSN search engine. Using the query logs, we build a time series for each query word or phrase (e.g., `Th...
Michail Vlachos, Christopher Meek, Zografoula Vage...
SIGIR
2006
ACM
16 years 8 days ago
Probabilistic latent query analysis for combining multiple retrieval sources
Combining the output from multiple retrieval sources over the same document collection is of great importance to a number of retrieval tasks such as multimedia retrieval, web retr...
Rong Yan, Alexander G. Hauptmann
WIDM
2005
ACM
15 years 12 months ago
Query translation scheme for heterogeneous XML data sources
In order to formulate a meaningful XML query, a user must have some knowledge of the schema of the XML documents to be queried. The query will succeed only if the schema of the ac...
Cindy X. Chen, George A. Mihaila, Sriram Padmanabh...