4865 search results - page 950 / 973 » The Complexity of Graph Connectivity |
STOC
2007
ACM
14 years 10 months ago
2007
ACM
In this work, we consider the problems of testing whether a distribution over {0, 1}n is k-wise (resp. ( , k)-wise) independent using samples drawn from that distribution. For the...
STOC
2004
ACM
14 years 10 months ago
2004
ACM
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
VLDB
2002
ACM
14 years 10 months ago
2002
ACM
: Purpose ? Tree pattern is at the core of XML queries. The tree patterns in XML queries typically contain redundancies, especially when broad integrity constraints (ICs) are prese...
PODS
2002
ACM
14 years 10 months ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
ICCAD
2002
IEEE
14 years 7 months ago
2002
IEEE
— One of the bottlenecks in the recent movement of hardware synthesis from behavioral C programs is the difficulty in reasoning about runtime pointer values at compile time. The...