Sciweavers

9209 search results - page 78 / 1842
» Data Space Randomization
Sort
View
TON
2002
175views more  TON 2002»
15 years 2 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
111
Voted
ICASSP
2008
IEEE
15 years 9 months ago
Compressive wireless arrays for bearing estimation
Joint processing of sensor array outputs improves the performance of parameter estimation and hypothesis testing problems beyond the sum of the individual sensor processing result...
Volkan Cevher, Ali Cafer Gurbuz, James H. McClella...
ICDM
2007
IEEE
121views Data Mining» more  ICDM 2007»
15 years 8 months ago
ORIGAMI: Mining Representative Orthogonal Graph Patterns
In this paper, we introduce the concept of α-orthogonal patterns to mine a representative set of graph patterns. Intuitively, two graph patterns are α-orthogonal if their simila...
Mohammad Al Hasan, Vineet Chaoji, Saeed Salem, J&e...
ICASSP
2011
IEEE
14 years 6 months ago
Exploiting an interplay between norms to analyze scalar quantization schemes
Quantization is intrinsic to several data acquisition systems. This process is especially important in distributed settings, where observations must rst be compressed before they ...
Parimal Parag, Jean-François Chamberland
PODS
2006
ACM
122views Database» more  PODS 2006»
16 years 2 months ago
Space- and time-efficient deterministic algorithms for biased quantiles over data streams
Skew is prevalent in data streams, and should be taken into account by algorithms that analyze the data. The problem of finding "biased quantiles"-- that is, approximate...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...