Sciweavers

481 search results - page 76 / 97
» Approximate XML Query Answers
Sort
View
VMCAI
2007
Springer
14 years 1 months ago
Better Under-Approximation of Programs by Hiding Variables
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
Thomas Ball, Orna Kupferman
ALT
2009
Springer
14 years 4 months ago
Average-Case Active Learning with Costs
Abstract. We analyze the expected cost of a greedy active learning algorithm. Our analysis extends previous work to a more general setting in which different queries have differe...
Andrew Guillory, Jeff A. Bilmes
PODS
2005
ACM
109views Database» more  PODS 2005»
14 years 7 months ago
XPath satisfiability in the presence of DTDs
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
Michael Benedikt, Wenfei Fan, Floris Geerts
INEX
2007
Springer
14 years 1 months ago
Using Wikipedia Categories and Links in Entity Ranking
This paper describes the participation of the INRIA group in the INEX 2007 XML entity ranking and ad hoc tracks. We developed a system for ranking Wikipedia entities in answer to a...
Anne-Marie Vercoustre, Jovan Pehcevski, James A. T...
ICDT
2005
ACM
95views Database» more  ICDT 2005»
14 years 1 months ago
Semantics of Data Streams and Operators
What does a data stream mean? Much of the extensive work on query operators and query processing for data streams has proceeded without the benefit of an answer to this question. ...
David Maier, Jin Li, Peter A. Tucker, Kristin Tuft...