7930 search results - page 1325 / 1586 » Greedy in Approximation Algorithms |
145
Voted
ESA
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. A materialized view is a certain synopsis structure precomputed from one or more data sets (called base tables) in order to facilitate various queries on the data. When t...
126
click to vote
ICS
2003
Tsinghua U.
15 years 10 months ago
2003
Tsinghua U.
Cache behavior modeling is an important part of modern optimizing compilers. In this paper we present a method to estimate the number of cache misses, at compile time, using a mac...
138
Voted
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...
143
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...
126
click to vote
VLDB
2001
ACM
15 years 9 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. ...