2661 search results - page 257 / 533 » Quantum Complexity Classes |
251
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. A class of probabilistic-logic models is considered, which increases the expressibility from HMM's and SCFG's regular and contextfree languages to, in principle...
241
click to vote
SIGMOD
2006
ACM
16 years 4 months ago
2006
ACM
This paper introduces the Tuple Graph (TuG) synopses, a new class of data summaries that enable accurate selectivity estimates for complex relational queries. The proposed summari...
120
click to vote
PODS
2005
ACM
16 years 4 months ago
2005
ACM
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...
162
click to vote
MATES
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. Taxonomies in the area of Multi-Agent Systems (MAS) classify problems according to the underlying principles and assumptions of the agents’ abilities, rationality and i...
133
click to vote
LICS
2007
IEEE
15 years 10 months ago
2007
IEEE
In an influential paper titled “The Benefits of Relaxing Punctuality” [2], Alur, Feder, and Henzinger introduced Metric Interval Temporal Logic (MITL) as a fragment of the r...