2924 search results - page 140 / 585 » Lower Bounds in Distributed Computing |
89
Voted
COMPGEOM
2000
ACM
15 years 5 months ago
2000
ACM
Let A be the incidence matrix of a set system with m sets and n points, m ≤ n, and let t = tr M, where M = AT A. Finally, let σ = tr M2 be the sum of squares of the elements of ...
78
Voted
COLT
2004
Springer
15 years 6 months ago
2004
Springer
Abstract— We prove that given a nearly log-concave distribution, in any partition of the space to two well separated sets, the measure of the points that do not belong to these s...
88
Voted
UAI
2004
15 years 2 months ago
2004
In this paper, we propose a new lower approximation scheme for POMDP with discounted and average cost criterion. The approximating functions are determined by their values at a fi...
104
click to vote
CINQ
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Data mining algorithms such as the Apriori method for finding frequent sets in sparse binary data can be used for efficient computation of a large number of summaries fr...
109
click to vote
ASIACRYPT
2006
Springer
15 years 4 months ago
2006
Springer
We consider the problem of cheating in secret sharing schemes, cheating in which individuals submit forged shares in the secret reconstruction phase in an effort to make another pa...