Sciweavers

2853 search results - page 228 / 571
» On the Efficiency of Provenance Queries
Sort
View
STOC
1994
ACM
128views Algorithms» more  STOC 1994»
15 years 10 months ago
Weakly learning DNF and characterizing statistical query learning using Fourier analysis
We present new results on the well-studied problem of learning DNF expressions. We prove that an algorithm due to Kushilevitz and Mansour [13] can be used to weakly learn DNF form...
Avrim Blum, Merrick L. Furst, Jeffrey C. Jackson, ...
VLDB
1995
ACM
97views Database» more  VLDB 1995»
15 years 10 months ago
Processing Object-Oriented Queries with Invertible Late Bound Functions
New demandsare put on query processing in Object-Oriented(00) databasesto provide efficient andrelationally completequery languages. A flexible 00 data model requires overloading ...
Staffan Flodin, Tore Risch
EDBT
2008
ACM
128views Database» more  EDBT 2008»
16 years 6 months ago
Processing transitive nearest-neighbor queries in multi-channel access environments
Wireless broadcast is an efficient way for information dissemination due to its good scalability [10]. Existing works typically assume mobile devices, such as cell phones and PDAs...
Xiao Zhang, Wang-Chien Lee, Prasenjit Mitra, Baihu...
SEMWEB
2004
Springer
15 years 12 months ago
An Initial Investigation into Querying an Untrustworthy and Inconsistent Web
The Semantic Web is bound to be untrustworthy and inconsistent. In this paper, we present an initial approach for obtaining useful information in such an environment. In particular...
Yuanbo Guo, Jeff Heflin
NDQA
2003
119views Education» more  NDQA 2003»
15 years 8 months ago
Inference Web: Portable and Sharable Explanations for Question Answering
The World Wide Web lacks support for explaining information provenance. When web applications return results, many users do not know what information sources were used, when they ...
Deborah L. McGuinness, Paulo Pinheiro da Silva