315 search results - page 43 / 63 » Algebraic Lower Bounds for Computing on Encrypted Data |
174
click to vote
PODS
2012
ACM
13 years 9 months ago
2012
ACM
We study the mergeability of data summaries. Informally speaking, mergeability requires that, given two summaries on two data sets, there is a way to merge the two summaries into ...
190
click to vote
CLUSTER
2001
IEEE
15 years 10 months ago
2001
IEEE
Given the increasing traffic on the World Wide Web (Web), it is difficult for a single popular Web server to handle the demand from its many clients. By clustering a group of Web ...
158
click to vote
PVLDB
2010
15 years 4 months ago
2010
We consider the problem of efficiently finding the top-k answers for join queries over web-accessible databases. Classical algorithms for finding top-k answers use branch-and-b...
168
click to vote
FOCS
2008
IEEE
16 years 1 months ago
2008
IEEE
We consider the read/write streams model, an extension of the standard data stream model in which an algorithm can create and manipulate multiple read/write streams in addition to...
201
click to vote
KDD
2012
ACM
13 years 9 months ago
2012
ACM
Non-negative matrix factorization (NMF) provides a lower rank approximation of a matrix. Due to nonnegativity imposed on the factors, it gives a latent structure that is often mor...