Sciweavers

320 search results - page 8 / 64
» Answering Queries from Statistics and Probabilistic Views
Sort
View
EDBT
2006
ACM
121views Database» more  EDBT 2006»
14 years 8 months ago
A Decomposition-Based Probabilistic Framework for Estimating the Selectivity of XML Twig Queries
In this paper we present a novel approach for estimating the selectivity of XML twig queries. Such a technique is useful for approximate query answering as well as for determining...
Chao Wang, Srinivasan Parthasarathy, Ruoming Jin
STOC
1993
ACM
117views Algorithms» more  STOC 1993»
14 years 15 days ago
Efficient noise-tolerant learning from statistical queries
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
Michael J. Kearns
PODS
2005
ACM
104views Database» more  PODS 2005»
14 years 8 months ago
Views and queries: determinacy and rewriting
We investigate the question of whether a query can be answered using a set V of views. We first define the problem in information-theoretic terms: we say that V determines if V pr...
Luc Segoufin, Victor Vianu
RIAO
2000
13 years 9 months ago
Statistical motion-based video indexing and retrieval
We propose an original approach for the characterization of video dynamic content with a view to supplying new functionalities for motion-based video indexing and retrieval with q...
Ronan Fablet, Patrick Bouthemy, P. Perez
ECIR
2007
Springer
13 years 10 months ago
Model Tree Learning for Query Term Weighting in Question Answering
Question answering systems rely on retrieval components to identify documents that contain an answer to a user’s question. The formulation of queries that are used for retrieving...
Christof Monz