7015 search results - page 1145 / 1403 » Approximation algorithms for co-clustering |
134
click to vote
FOCS
2002
IEEE
15 years 9 months ago
2002
IEEE
We give the first polynomial time algorithm to learn any function of a constant number of halfspaces under the uniform distribution on the Boolean hypercube to within any constan...
136
click to vote
SIGMOD
2010
ACM
15 years 9 months ago
2010
ACM
We propose PASTE, the first differentially private aggregation algorithms for distributed time-series data that offer good practical utility without any trusted server. PASTE add...
121
Voted
VLDB
2001
ACM
15 years 8 months ago
2001
ACM
This paper investigates the problem of incremental joins of multiple ranked data sets when the join condition is a list of arbitrary user-defined predicates on the input tuples. ...
191
click to vote
FOCS
2000
IEEE
15 years 8 months ago
2000
IEEE
In this article, we show several results obtained by combining the use of stable distributions with pseudorandom generators for bounded space. In particular: —We show that, for a...
127
Voted
INFOCOM
2000
IEEE
15 years 8 months ago
2000
IEEE
— In broadcast disk systems, information is broadcasted in a shared medium. When a client needs an item from the disk, it waits until that item is broadcasted. The fundamental al...