1071 search results - page 184 / 215 » Theories of Automatic Structures and Their Complexity |
KDD
2007
ACM
14 years 8 months ago
2007
ACM
The discovery of subsets with special properties from binary data has been one of the key themes in pattern discovery. Pattern classes such as frequent itemsets stress the co-occu...
PODS
2006
ACM
14 years 8 months ago
2006
ACM
Query containment is a fundamental algorithmic problem in database query processing and optimization. Under set semantics, the query-containment problem for conjunctive queries ha...
ICFP
2005
ACM
14 years 8 months ago
2005
ACM
module is a programming abstraction that simultaneously generalizes -abstractions, records, and mutually recursive definitions. Although various mixin module type systems have bee...
STACS
2010
Springer
14 years 3 months ago
2010
Springer
Abstract. A Boolean function on N variables is called evasive if its decision-tree complexity is N. A sequence Bn of Boolean functions is eventually evasive if Bn is evasive for al...
SCESM
2006
ACM
14 years 2 months ago
2006
ACM
As technical systems keep growing more complex and sophisticated, designing software for the safety-critical coordination between their components becomes increasingly difficult....