Sciweavers

1865 search results - page 254 / 373
» Pan-Private Streaming Algorithms
Sort
View
SDM
2010
SIAM
202views Data Mining» more  SDM 2010»
15 years 2 months ago
Multiresolution Motif Discovery in Time Series
Time series motif discovery is an important problem with applications in a variety of areas that range from telecommunications to medicine. Several algorithms have been proposed t...
Nuno Castro, Paulo J. Azevedo
SIGMOD
2004
ACM
92views Database» more  SIGMOD 2004»
16 years 4 months ago
Online Maintenance of Very Large Random Samples
Random sampling is one of the most fundamental data management tools available. However, most current research involving sampling considers the problem of how to use a sample, and...
Chris Jermaine, Abhijit Pol, Subramanian Arumugam
EDBT
2008
ACM
103views Database» more  EDBT 2008»
16 years 4 months ago
A stratified approach to progressive approximate joins
Users often do not require a complete answer to their query but rather only a sample. They expect the sample to be either the largest possible or the most representative (or both)...
Wee Hyong Tok, Stéphane Bressan, Mong-Li Le...
105
Voted
ASIAN
2007
Springer
114views Algorithms» more  ASIAN 2007»
15 years 10 months ago
Large Scale Simulation of Tor:
Implementing global passive adversary attacks on currently deployed low latency anonymous networks is not feasible. This paper describes the implementation of a large scale, discre...
Gavin O'Gorman, Stephen Blott
PODS
2006
ACM
95views Database» more  PODS 2006»
16 years 4 months ago
Randomized computations on large data sets: tight lower bounds
We study the randomized version of a computation model (introduced in [9, 10]) that restricts random access to external memory and internal memory space. Essentially, this model c...
André Hernich, Martin Grohe, Nicole Schweik...