4966 search results - page 81 / 994 » its 2010 |
149
click to vote
ECCC
2002
15 years 6 months ago
2002
We say that a distribution over {0, 1}n is ( , k)-wise independent if its restriction to every k coordinates results in a distribution that is -close to the uniform distribution. ...
173
click to vote
ECRA
2002
15 years 6 months ago
2002
Web Services will transform the web from a collection of information into a distributed computational device. In order to employ their full potential, appropriate description means...
178
click to vote
ENDM
2002
15 years 6 months ago
2002
Given a positive integer n and a family F of graphs, let R(n, F) denote the maximum number of colors in an edge-coloring of Kn such that no subgraph of Kn belonging to F has disti...
160
click to vote
ENTCS
2002
15 years 6 months ago
2002
This article discusses mutation testing strategies in the context of refinement. Here, a novel generalization of mutation testing techniques is presented to be applied to contract...
171
click to vote
ENTCS
2002
15 years 6 months ago
2002
The paper discusses the hierarchy of indices of finite automata over infinite objects. This hierarchy corresponds exactly to the hierarchy of alternations of least and greatest fi...