1696 search results - page 180 / 340 » Permuted function matching |
SOCA
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Workflow design, mashup configuration, and composite service formation are examples where the capabilities of multiple simple services combined achieve a complex function...
JCT
2011
14 years 6 months ago
2011
A non-crossing pairing on a bitstring matches 1s and 0s in a manner such that the pairing diagram is nonintersecting. By considering such pairings on arbitrary bitstrings 1n1 0m1 ....
106
click to vote
IMCSIT
2010
14 years 5 months ago
2010
The paper presents a concept, implementation and real examples of dynamic parallelization of computations using services derived from MPI applications deployed in the BeesyCluster ...
208
click to vote
FM
2011
Springer
14 years 2 months ago
2011
Springer
Abstract. In this paper we describe TRACECONTRACT, an API for trace analysis, implemented in the SCALA programming language. We argue that for certain forms of trace analysis the b...
118
click to vote
SIAMCOMP
2011
14 years 6 months ago
2011
Abstract. In the 2nd Annual FOCS (1961), Chao-Kong Chow proved that every Boolean threshold function is uniquely determined by its degree-0 and degree-1 Fourier coefficients. These...