1778 search results - page 295 / 356 » The Theory of Probabilistic Databases |
BIRTHDAY
2010
Springer
14 years 11 months ago
2010
Springer
The question of whether there is a logic that captures polynomial time was formulated by Yuri Gurevich in 1988. It is still wide open and regarded as one of the main open problems...
BMCBI
2010
14 years 10 months ago
2010
Background: With the continuously increasing demands on knowledge- and data-management that databases have to meet, ontologies and the theories of granularity they use become more...
JACM
2000
14 years 9 months ago
2000
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
111
click to vote
WWW
2008
ACM
15 years 10 months ago
2008
ACM
Inferring an appropriate DTD or XML Schema Definition (XSD) for a given collection of XML documents essentially reduces to learning deterministic regular expressions from sets of ...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
A function on n variables is called a k-junta if it depends on at most k of its variables. In this article, we show that it is possible to test whether a function is a k-junta or ...