2434 search results - page 43 / 487 » Algorithmic Randomness of Closed Sets |
CORR
2010
Springer
15 years 2 months ago
2010
Springer
We develop an algorithm for estimating the values of a vector x Rn over a support S of size k from a randomized sparse binary linear sketch Ax of size O(k). Given Ax and S, we ca...
101
click to vote
PAKDD
2004
ACM
15 years 7 months ago
2004
ACM
We are designing new data mining techniques on boolean contexts to identify a priori interesting concepts, i.e., closed sets of objects (or transactions) and associated closed sets...
134
click to vote
APPROX
2011
Springer
14 years 1 months ago
2011
Springer
In a well-known result Goldreich and Trevisan (2003) showed that every testable graph property has a “canonical” tester in which a set of vertices is selected at random and the...
130
click to vote
DMSN
2004
ACM
15 years 7 months ago
2004
ACM
Recent work in sensor databases has focused extensively on distributed query problems, notably distributed computation of aggregates. Existing methods for computing aggregates bro...
114
click to vote
STOC
2004
ACM
16 years 2 months ago
2004
ACM
We prove the following inequality: for every positive integer n and every collection X1, . . . , Xn of nonnegative independent random variables that each has expectation 1, the pr...