1117 search results - page 105 / 224 » Equivalent Representations of Set Functions |
JSS
2008
14 years 9 months ago
2008
QoS-aware dynamic binding of composite services provides the capability of binding each service invocation in a composition to a service chosen among a set of functionally equival...
LICS
2007
IEEE
15 years 4 months ago
2007
IEEE
According to Strachey, a polymorphic program is parametric if it applies a uniform algorithm independently of the type instantiations at which it is applied. The notion of relatio...
ISMVL
2010
IEEE
15 years 2 months ago
2010
IEEE
—Fixed-point multiplication architectures are designed and evaluated using a set of logic cells based on a radix-4, quaternary number system. The library of logic circuits is bas...
ASIACRYPT
2000
Springer
15 years 2 months ago
2000
Springer
Abstract. We investigate several alternate characterizations of pseudorandom functions (PRFs) and pseudorandom permutations (PRPs) in a concrete security setting. By analyzing the ...
ERSHOV
2006
Springer
15 years 1 months ago
2006
Springer
In this work, we present a semantic query optimization technique to improve the efficiency of the evaluation of a subset of SQL:1999 recursive queries. Using datalog notation, we c...