1211 search results - page 2 / 243 » Topics in 0--1 data |
SDM
2012
SIAM
12 years 11 months ago
2012
SIAM
103
click to vote
ECCC
2010
14 years 9 months ago
2010
Assuming the existence of one-way functions, we show that there is no polynomial-time, differentially private algorithm A that takes a database D ({0, 1}d )n and outputs a "...
STOC
2009
ACM
15 years 10 months ago
2009
ACM
We prove lower bounds on the redundancy necessary to represent a set S of objects using a number of bits close to the information-theoretic minimum log2 |S|, while answering vario...
SODA
2012
ACM
12 years 12 months ago
2012
ACM
We consider the problem of recovering items matching a partially specified pattern in multidimensional trees (quad trees and k-d trees). We assume the traditional model where the...
SIAMCO
2000
14 years 9 months ago
2000
We study almost-sure limiting properties, taken as 0, of the finite horizon sequence of random estimates { 0, 1, 2, . . . , T/ } for the linear stochastic gradient algorithm n+1 ...