Sciweavers

387 search results - page 7 / 78
» Reasoning About Approximate Match Query Results
Sort
View
LPNMR
2011
Springer
12 years 10 months ago
Approximations for Explanations of Inconsistency in Partially Known Multi-Context Systems
Abstract. Multi-context systems are a formalism to interlink decentralized and heterogeneous knowledge based systems (contexts), which interact via (possibly nonmonotonic) bridge r...
Thomas Eiter, Michael Fink, Peter Schüller
GRID
2003
Springer
14 years 21 days ago
Scoped and Approximate Queries in a Relational Grid Information Service
We are developing a grid information service, RGIS, that is based on the relational data model. RGIS supports complex queries written in SQL that search for compositions (using jo...
Dong Lu, Peter A. Dinda, Jason A. Skicewicz
NAACL
2010
13 years 5 months ago
Learning about Voice Search for Spoken Dialogue Systems
In a Wizard-of-Oz experiment with multiple wizard subjects, each wizard viewed automated speech recognition (ASR) results for utterances whose interpretation is critical to task s...
Rebecca J. Passonneau, Susan L. Epstein, Tiziana L...
ICDE
2001
IEEE
128views Database» more  ICDE 2001»
14 years 8 months ago
Counting Twig Matches in a Tree
We describe efficient algorithms for accurately estimating the number of matches of a small node-labeled tree, i.e., a twig, in a large node-labeled tree, using a summary data str...
Zhiyuan Chen, H. V. Jagadish, Flip Korn, Nick Koud...
CORR
2012
Springer
217views Education» more  CORR 2012»
12 years 3 months ago
An Adaptive Mechanism for Accurate Query Answering under Differential Privacy
We propose a novel mechanism for answering sets of counting queries under differential privacy. Given a workload of counting queries, the mechanism automatically selects a differ...
Chao Li, Gerome Miklau