3359 search results - page 509 / 672 » A Simplified Idea Algorithm |
POPL
2008
ACM
14 years 10 months ago
2008
ACM
Contracts are behavioural descriptions of Web services. We devise a theory of contracts that formalises the compatibility of a client to a service, and the safe replacement of a s...
POPL
2004
ACM
14 years 10 months ago
2004
ACM
We aim to specify program transformations in a declarative style, and then to generate executable program transformers from such specifications. Many transformations require non-t...
CADE
2002
Springer
14 years 10 months ago
2002
Springer
The classical NP-complete problem of Boolean Satisfiability (SAT) has seen much interest in not just the theoretical computer science community, but also in areas where practical s...
SIGMOD
2006
ACM
14 years 10 months ago
2006
ACM
Traditional duplicate elimination techniques are not applicable to many data stream applications. In general, precisely eliminating duplicates in an unbounded data stream is not f...
SIGMOD
2006
ACM
14 years 10 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...