Sciweavers

7150 search results - page 1298 / 1430
» An Approximation Algorithm for Approximation Rank
Sort
View
ESA
2005
Springer
113views Algorithms» more  ESA 2005»
15 years 12 months ago
Online View Maintenance Under a Response-Time Constraint
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...
Kamesh Munagala, Jun Yang 0001, Hai Yu
ICS
2003
Tsinghua U.
15 years 11 months ago
Estimating cache misses and locality using stack distances
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...
Calin Cascaval, David A. Padua
FOCS
2002
IEEE
15 years 11 months ago
Learning Intersections and Thresholds of Halfspaces
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...
Adam Klivans, Ryan O'Donnell, Rocco A. Servedio
SIGMOD
2010
ACM
236views Database» more  SIGMOD 2010»
15 years 11 months ago
Differentially private aggregation of distributed time-series with transformation and encryption
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...
Vibhor Rastogi, Suman Nath
219
Voted
FOCS
2000
IEEE
15 years 10 months ago
Stable Distributions, Pseudorandom Generators, Embeddings and Data Stream Computation
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...
Piotr Indyk
« Prev « First page 1298 / 1430 Last » Next »